./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix020.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix020.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 b3c17f675455332f72f7dc385a60a0aa293a9aeb1dd45189023ae89322443476 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:13:54,580 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:13:54,582 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:13:54,617 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:13:54,617 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:13:54,620 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:13:54,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:13:54,625 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:13:54,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:13:54,631 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:13:54,632 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:13:54,634 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:13:54,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:13:54,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:13:54,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:13:54,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:13:54,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:13:54,647 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:13:54,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:13:54,654 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:13:54,655 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:13:54,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:13:54,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:13:54,670 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:13:54,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:13:54,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:13:54,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:13:54,678 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:13:54,679 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:13:54,679 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:13:54,680 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:13:54,681 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:13:54,683 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:13:54,684 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:13:54,684 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:13:54,685 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:13:54,685 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:13:54,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:13:54,686 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:13:54,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:13:54,687 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:13:54,689 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:13:54,728 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:13:54,728 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:13:54,728 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:13:54,729 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:13:54,729 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:13:54,729 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:13:54,730 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:13:54,730 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:13:54,730 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:13:54,730 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:13:54,730 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:13:54,730 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:13:54,730 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:13:54,731 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:13:54,731 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:13:54,731 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:13:54,731 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:13:54,731 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:13:54,731 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:13:54,731 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:13:54,731 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:13:54,732 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:13:54,732 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:13:54,732 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:13:54,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:13:54,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:13:54,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:13:54,732 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:13:54,732 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:13:54,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:13:54,733 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:13:54,733 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:13:54,733 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:13:54,733 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:13:54,734 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 -> b3c17f675455332f72f7dc385a60a0aa293a9aeb1dd45189023ae89322443476 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:13:55,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:13:55,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:13:55,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:13:55,081 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:13:55,081 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:13:55,083 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix020.opt.i [2023-08-31 23:13:56,322 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:13:56,580 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:13:56,581 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix020.opt.i [2023-08-31 23:13:56,602 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/591c1e6eb/ebe03c648a6948b1aeffaa2008d20435/FLAG0ca424080 [2023-08-31 23:13:56,615 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/591c1e6eb/ebe03c648a6948b1aeffaa2008d20435 [2023-08-31 23:13:56,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:13:56,618 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:13:56,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:13:56,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:13:56,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:13:56,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:13:56" (1/1) ... [2023-08-31 23:13:56,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7db6ce09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:56, skipping insertion in model container [2023-08-31 23:13:56,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:13:56" (1/1) ... [2023-08-31 23:13:56,630 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:13:56,689 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:13:56,804 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/mix020.opt.i[944,957] [2023-08-31 23:13:57,005 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:13:57,019 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:13:57,029 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/mix020.opt.i[944,957] [2023-08-31 23:13:57,091 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:13:57,139 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:13:57,140 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:13:57,145 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:13:57,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:57 WrapperNode [2023-08-31 23:13:57,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:13:57,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:13:57,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:13:57,148 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:13:57,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:57" (1/1) ... [2023-08-31 23:13:57,184 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:57" (1/1) ... [2023-08-31 23:13:57,224 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2023-08-31 23:13:57,226 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:13:57,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:13:57,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:13:57,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:13:57,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:57" (1/1) ... [2023-08-31 23:13:57,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:57" (1/1) ... [2023-08-31 23:13:57,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:57" (1/1) ... [2023-08-31 23:13:57,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:57" (1/1) ... [2023-08-31 23:13:57,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:57" (1/1) ... [2023-08-31 23:13:57,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:57" (1/1) ... [2023-08-31 23:13:57,275 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:57" (1/1) ... [2023-08-31 23:13:57,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:57" (1/1) ... [2023-08-31 23:13:57,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:13:57,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:13:57,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:13:57,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:13:57,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:57" (1/1) ... [2023-08-31 23:13:57,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:13:57,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:13:57,322 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:13:57,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:13:57,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:13:57,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:13:57,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:13:57,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:13:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:13:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:13:57,359 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:13:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:13:57,359 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:13:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:13:57,359 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:13:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:13:57,360 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:13:57,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:13:57,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:13:57,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:13:57,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:13:57,361 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:13:57,525 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:13:57,528 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:13:57,860 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:13:58,054 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:13:58,059 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:13:58,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:13:58 BoogieIcfgContainer [2023-08-31 23:13:58,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:13:58,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:13:58,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:13:58,067 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:13:58,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:13:56" (1/3) ... [2023-08-31 23:13:58,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a6d2f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:13:58, skipping insertion in model container [2023-08-31 23:13:58,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:57" (2/3) ... [2023-08-31 23:13:58,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a6d2f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:13:58, skipping insertion in model container [2023-08-31 23:13:58,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:13:58" (3/3) ... [2023-08-31 23:13:58,070 INFO L112 eAbstractionObserver]: Analyzing ICFG mix020.opt.i [2023-08-31 23:13:58,086 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:13:58,087 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:13:58,087 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:13:58,176 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:13:58,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 300 flow [2023-08-31 23:13:58,292 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2023-08-31 23:13:58,293 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:13:58,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-08-31 23:13:58,298 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 140 transitions, 300 flow [2023-08-31 23:13:58,308 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 136 transitions, 284 flow [2023-08-31 23:13:58,313 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:13:58,329 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 136 transitions, 284 flow [2023-08-31 23:13:58,333 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 136 transitions, 284 flow [2023-08-31 23:13:58,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 284 flow [2023-08-31 23:13:58,380 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2023-08-31 23:13:58,380 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:13:58,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-08-31 23:13:58,384 INFO L119 LiptonReduction]: Number of co-enabled transitions 3024 [2023-08-31 23:14:03,446 INFO L134 LiptonReduction]: Checked pairs total: 8476 [2023-08-31 23:14:03,447 INFO L136 LiptonReduction]: Total number of compositions: 129 [2023-08-31 23:14:03,465 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:14:03,472 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;@85c4c64, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:14:03,472 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:14:03,474 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:14:03,474 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:14:03,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:03,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:14:03,476 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:03,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:03,481 INFO L85 PathProgramCache]: Analyzing trace with hash 601, now seen corresponding path program 1 times [2023-08-31 23:14:03,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:03,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990903382] [2023-08-31 23:14:03,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:03,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:03,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:03,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:03,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990903382] [2023-08-31 23:14:03,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990903382] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:03,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:03,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:14:03,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67683507] [2023-08-31 23:14:03,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:03,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:14:03,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:03,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:14:03,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:14:03,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 269 [2023-08-31 23:14:03,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:03,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:03,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 269 [2023-08-31 23:14:03,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:04,414 INFO L130 PetriNetUnfolder]: 4373/6061 cut-off events. [2023-08-31 23:14:04,414 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2023-08-31 23:14:04,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12147 conditions, 6061 events. 4373/6061 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 30588 event pairs, 4373 based on Foata normal form. 0/5337 useless extension candidates. Maximal degree in co-relation 12135. Up to 5983 conditions per place. [2023-08-31 23:14:04,457 INFO L137 encePairwiseOnDemand]: 260/269 looper letters, 26 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2023-08-31 23:14:04,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 122 flow [2023-08-31 23:14:04,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:14:04,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:14:04,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 289 transitions. [2023-08-31 23:14:04,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5371747211895911 [2023-08-31 23:14:04,476 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 289 transitions. [2023-08-31 23:14:04,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 289 transitions. [2023-08-31 23:14:04,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:04,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 289 transitions. [2023-08-31 23:14:04,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 144.5) internal successors, (289), 2 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:04,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:04,491 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:04,492 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 2 states and 289 transitions. [2023-08-31 23:14:04,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 122 flow [2023-08-31 23:14:04,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:14:04,499 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-08-31 23:14:04,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-08-31 23:14:04,504 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-08-31 23:14:04,504 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-08-31 23:14:04,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:04,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:04,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:04,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:14:04,509 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:04,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:04,510 INFO L85 PathProgramCache]: Analyzing trace with hash -736274069, now seen corresponding path program 1 times [2023-08-31 23:14:04,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:04,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410154117] [2023-08-31 23:14:04,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:04,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:04,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:04,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410154117] [2023-08-31 23:14:04,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410154117] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:04,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:04,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:14:04,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105052960] [2023-08-31 23:14:04,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:04,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:14:04,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:04,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:14:04,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:14:04,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 269 [2023-08-31 23:14:04,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:04,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:04,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 269 [2023-08-31 23:14:04,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:05,398 INFO L130 PetriNetUnfolder]: 3632/5248 cut-off events. [2023-08-31 23:14:05,398 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:14:05,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10338 conditions, 5248 events. 3632/5248 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 28604 event pairs, 668 based on Foata normal form. 0/4884 useless extension candidates. Maximal degree in co-relation 10335. Up to 3973 conditions per place. [2023-08-31 23:14:05,424 INFO L137 encePairwiseOnDemand]: 266/269 looper letters, 34 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-08-31 23:14:05,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 166 flow [2023-08-31 23:14:05,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:14:05,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:14:05,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-08-31 23:14:05,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.516728624535316 [2023-08-31 23:14:05,427 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-08-31 23:14:05,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-08-31 23:14:05,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:05,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-08-31 23:14:05,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:05,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:05,433 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:05,433 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 3 states and 417 transitions. [2023-08-31 23:14:05,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 166 flow [2023-08-31 23:14:05,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:14:05,435 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2023-08-31 23:14:05,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-31 23:14:05,436 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-08-31 23:14:05,436 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2023-08-31 23:14:05,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:05,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:05,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:05,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:14:05,437 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:05,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:05,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1110318044, now seen corresponding path program 1 times [2023-08-31 23:14:05,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:05,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645045643] [2023-08-31 23:14:05,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:05,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:05,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:05,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:05,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645045643] [2023-08-31 23:14:05,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645045643] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:05,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:05,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:14:05,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964224324] [2023-08-31 23:14:05,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:05,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:14:05,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:05,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:14:05,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:14:05,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 269 [2023-08-31 23:14:05,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:05,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:05,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 269 [2023-08-31 23:14:05,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:06,319 INFO L130 PetriNetUnfolder]: 4175/5725 cut-off events. [2023-08-31 23:14:06,319 INFO L131 PetriNetUnfolder]: For 276/276 co-relation queries the response was YES. [2023-08-31 23:14:06,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11852 conditions, 5725 events. 4175/5725 cut-off events. For 276/276 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 27425 event pairs, 1165 based on Foata normal form. 0/5502 useless extension candidates. Maximal degree in co-relation 11848. Up to 5234 conditions per place. [2023-08-31 23:14:06,356 INFO L137 encePairwiseOnDemand]: 265/269 looper letters, 39 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2023-08-31 23:14:06,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 190 flow [2023-08-31 23:14:06,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:14:06,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:14:06,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-31 23:14:06,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142503097893433 [2023-08-31 23:14:06,358 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-31 23:14:06,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-31 23:14:06,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:06,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-31 23:14:06,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:06,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:06,362 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:06,362 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 3 states and 415 transitions. [2023-08-31 23:14:06,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 190 flow [2023-08-31 23:14:06,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:14:06,365 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 81 flow [2023-08-31 23:14:06,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-08-31 23:14:06,365 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-08-31 23:14:06,366 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 81 flow [2023-08-31 23:14:06,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:06,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:06,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:06,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:14:06,367 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:06,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:06,367 INFO L85 PathProgramCache]: Analyzing trace with hash 60119347, now seen corresponding path program 1 times [2023-08-31 23:14:06,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:06,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568461868] [2023-08-31 23:14:06,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:06,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:06,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-31 23:14:06,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:06,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568461868] [2023-08-31 23:14:06,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568461868] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:06,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:06,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:14:06,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317219383] [2023-08-31 23:14:06,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:06,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:14:06,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:06,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:14:06,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:14:06,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 269 [2023-08-31 23:14:06,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 81 flow. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:06,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:06,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 269 [2023-08-31 23:14:06,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:07,577 INFO L130 PetriNetUnfolder]: 9031/12336 cut-off events. [2023-08-31 23:14:07,578 INFO L131 PetriNetUnfolder]: For 1596/1596 co-relation queries the response was YES. [2023-08-31 23:14:07,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27024 conditions, 12336 events. 9031/12336 cut-off events. For 1596/1596 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 59466 event pairs, 1999 based on Foata normal form. 240/12576 useless extension candidates. Maximal degree in co-relation 27019. Up to 6417 conditions per place. [2023-08-31 23:14:07,650 INFO L137 encePairwiseOnDemand]: 260/269 looper letters, 52 selfloop transitions, 10 changer transitions 0/62 dead transitions. [2023-08-31 23:14:07,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 62 transitions, 291 flow [2023-08-31 23:14:07,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:14:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:14:07,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2023-08-31 23:14:07,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49256505576208176 [2023-08-31 23:14:07,653 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 530 transitions. [2023-08-31 23:14:07,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 530 transitions. [2023-08-31 23:14:07,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:07,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 530 transitions. [2023-08-31 23:14:07,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:07,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:07,657 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:07,657 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 81 flow. Second operand 4 states and 530 transitions. [2023-08-31 23:14:07,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 62 transitions, 291 flow [2023-08-31 23:14:07,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:14:07,665 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 162 flow [2023-08-31 23:14:07,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-08-31 23:14:07,666 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2023-08-31 23:14:07,667 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 162 flow [2023-08-31 23:14:07,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:07,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:07,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:07,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:14:07,668 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:07,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:07,668 INFO L85 PathProgramCache]: Analyzing trace with hash 60121945, now seen corresponding path program 1 times [2023-08-31 23:14:07,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:07,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540191017] [2023-08-31 23:14:07,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:07,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:08,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:08,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:08,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540191017] [2023-08-31 23:14:08,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540191017] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:08,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:08,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:14:08,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659788448] [2023-08-31 23:14:08,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:08,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:14:08,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:08,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:14:08,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:14:08,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 269 [2023-08-31 23:14:08,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 162 flow. Second operand has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:08,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:08,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 269 [2023-08-31 23:14:08,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:09,579 INFO L130 PetriNetUnfolder]: 7337/10599 cut-off events. [2023-08-31 23:14:09,579 INFO L131 PetriNetUnfolder]: For 7320/7486 co-relation queries the response was YES. [2023-08-31 23:14:09,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27399 conditions, 10599 events. 7337/10599 cut-off events. For 7320/7486 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 60549 event pairs, 1089 based on Foata normal form. 416/10575 useless extension candidates. Maximal degree in co-relation 27392. Up to 6833 conditions per place. [2023-08-31 23:14:09,653 INFO L137 encePairwiseOnDemand]: 262/269 looper letters, 62 selfloop transitions, 6 changer transitions 0/76 dead transitions. [2023-08-31 23:14:09,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 76 transitions, 422 flow [2023-08-31 23:14:09,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:14:09,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:14:09,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 836 transitions. [2023-08-31 23:14:09,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4439723844928306 [2023-08-31 23:14:09,657 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 836 transitions. [2023-08-31 23:14:09,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 836 transitions. [2023-08-31 23:14:09,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:09,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 836 transitions. [2023-08-31 23:14:09,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:09,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 269.0) internal successors, (2152), 8 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:09,663 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 269.0) internal successors, (2152), 8 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:09,663 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 162 flow. Second operand 7 states and 836 transitions. [2023-08-31 23:14:09,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 76 transitions, 422 flow [2023-08-31 23:14:09,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 76 transitions, 419 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:14:09,669 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 191 flow [2023-08-31 23:14:09,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=191, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-08-31 23:14:09,670 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2023-08-31 23:14:09,670 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 191 flow [2023-08-31 23:14:09,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:09,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:09,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:09,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:14:09,672 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:09,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:09,672 INFO L85 PathProgramCache]: Analyzing trace with hash -2132245759, now seen corresponding path program 1 times [2023-08-31 23:14:09,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:09,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953370727] [2023-08-31 23:14:09,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:09,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:09,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-31 23:14:09,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:09,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953370727] [2023-08-31 23:14:09,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953370727] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:09,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:09,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:14:09,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237971294] [2023-08-31 23:14:09,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:09,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:14:09,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:09,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:14:09,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:14:10,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 269 [2023-08-31 23:14:10,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:10,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:10,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 269 [2023-08-31 23:14:10,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:10,761 INFO L130 PetriNetUnfolder]: 5473/8161 cut-off events. [2023-08-31 23:14:10,762 INFO L131 PetriNetUnfolder]: For 5660/5840 co-relation queries the response was YES. [2023-08-31 23:14:10,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21909 conditions, 8161 events. 5473/8161 cut-off events. For 5660/5840 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 48112 event pairs, 1245 based on Foata normal form. 474/8291 useless extension candidates. Maximal degree in co-relation 21899. Up to 5996 conditions per place. [2023-08-31 23:14:10,820 INFO L137 encePairwiseOnDemand]: 262/269 looper letters, 70 selfloop transitions, 10 changer transitions 0/88 dead transitions. [2023-08-31 23:14:10,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 88 transitions, 540 flow [2023-08-31 23:14:10,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:14:10,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:14:10,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 656 transitions. [2023-08-31 23:14:10,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4877323420074349 [2023-08-31 23:14:10,822 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 656 transitions. [2023-08-31 23:14:10,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 656 transitions. [2023-08-31 23:14:10,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:10,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 656 transitions. [2023-08-31 23:14:10,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:10,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:10,827 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:10,827 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 191 flow. Second operand 5 states and 656 transitions. [2023-08-31 23:14:10,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 88 transitions, 540 flow [2023-08-31 23:14:10,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 88 transitions, 524 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:14:10,832 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 258 flow [2023-08-31 23:14:10,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=258, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2023-08-31 23:14:10,833 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2023-08-31 23:14:10,833 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 258 flow [2023-08-31 23:14:10,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:10,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:10,834 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-31 23:14:10,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:14:10,834 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:10,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:10,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1126225953, now seen corresponding path program 1 times [2023-08-31 23:14:10,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:10,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164858320] [2023-08-31 23:14:10,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:10,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:11,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:11,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164858320] [2023-08-31 23:14:11,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164858320] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:11,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:11,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:14:11,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116058750] [2023-08-31 23:14:11,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:11,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:14:11,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:11,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:14:11,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:14:11,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 269 [2023-08-31 23:14:11,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:11,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:11,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 269 [2023-08-31 23:14:11,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:12,048 INFO L130 PetriNetUnfolder]: 8955/13058 cut-off events. [2023-08-31 23:14:12,048 INFO L131 PetriNetUnfolder]: For 17300/17300 co-relation queries the response was YES. [2023-08-31 23:14:12,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45293 conditions, 13058 events. 8955/13058 cut-off events. For 17300/17300 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 74404 event pairs, 2006 based on Foata normal form. 101/13159 useless extension candidates. Maximal degree in co-relation 45280. Up to 6079 conditions per place. [2023-08-31 23:14:12,118 INFO L137 encePairwiseOnDemand]: 260/269 looper letters, 70 selfloop transitions, 17 changer transitions 17/104 dead transitions. [2023-08-31 23:14:12,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 104 transitions, 734 flow [2023-08-31 23:14:12,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:14:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:14:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 542 transitions. [2023-08-31 23:14:12,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5037174721189591 [2023-08-31 23:14:12,122 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 542 transitions. [2023-08-31 23:14:12,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 542 transitions. [2023-08-31 23:14:12,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:12,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 542 transitions. [2023-08-31 23:14:12,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:12,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:12,126 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:12,126 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 258 flow. Second operand 4 states and 542 transitions. [2023-08-31 23:14:12,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 104 transitions, 734 flow [2023-08-31 23:14:12,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 104 transitions, 725 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:14:12,147 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 347 flow [2023-08-31 23:14:12,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=347, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2023-08-31 23:14:12,148 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2023-08-31 23:14:12,148 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 347 flow [2023-08-31 23:14:12,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:12,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:12,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:12,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:14:12,149 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:12,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:12,150 INFO L85 PathProgramCache]: Analyzing trace with hash 796370192, now seen corresponding path program 1 times [2023-08-31 23:14:12,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:12,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6307416] [2023-08-31 23:14:12,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:12,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:12,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:12,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:12,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6307416] [2023-08-31 23:14:12,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6307416] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:12,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:12,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:14:12,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499451126] [2023-08-31 23:14:12,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:12,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:14:12,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:12,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:14:12,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:14:12,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 269 [2023-08-31 23:14:12,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 347 flow. Second operand has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:12,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:12,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 269 [2023-08-31 23:14:12,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:13,172 INFO L130 PetriNetUnfolder]: 3169/5069 cut-off events. [2023-08-31 23:14:13,172 INFO L131 PetriNetUnfolder]: For 9577/9797 co-relation queries the response was YES. [2023-08-31 23:14:13,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18487 conditions, 5069 events. 3169/5069 cut-off events. For 9577/9797 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 30120 event pairs, 444 based on Foata normal form. 454/5379 useless extension candidates. Maximal degree in co-relation 18472. Up to 2549 conditions per place. [2023-08-31 23:14:13,210 INFO L137 encePairwiseOnDemand]: 262/269 looper letters, 85 selfloop transitions, 14 changer transitions 1/113 dead transitions. [2023-08-31 23:14:13,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 113 transitions, 901 flow [2023-08-31 23:14:13,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:14:13,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:14:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 789 transitions. [2023-08-31 23:14:13,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888475836431227 [2023-08-31 23:14:13,213 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 789 transitions. [2023-08-31 23:14:13,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 789 transitions. [2023-08-31 23:14:13,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:13,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 789 transitions. [2023-08-31 23:14:13,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.5) internal successors, (789), 6 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:13,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:13,218 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:13,219 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 347 flow. Second operand 6 states and 789 transitions. [2023-08-31 23:14:13,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 113 transitions, 901 flow [2023-08-31 23:14:13,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 113 transitions, 864 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-08-31 23:14:13,247 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 452 flow [2023-08-31 23:14:13,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=452, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2023-08-31 23:14:13,248 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2023-08-31 23:14:13,248 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 452 flow [2023-08-31 23:14:13,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:13,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:13,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:13,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:14:13,249 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:13,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:13,250 INFO L85 PathProgramCache]: Analyzing trace with hash -2081605496, now seen corresponding path program 1 times [2023-08-31 23:14:13,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:13,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395702651] [2023-08-31 23:14:13,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:13,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:13,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:13,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:13,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395702651] [2023-08-31 23:14:13,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395702651] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:13,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:13,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:14:13,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668379649] [2023-08-31 23:14:13,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:13,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:14:13,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:13,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:14:13,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:14:13,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 269 [2023-08-31 23:14:13,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 452 flow. Second operand has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:13,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:13,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 269 [2023-08-31 23:14:13,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:14,056 INFO L130 PetriNetUnfolder]: 2338/3784 cut-off events. [2023-08-31 23:14:14,057 INFO L131 PetriNetUnfolder]: For 8822/9162 co-relation queries the response was YES. [2023-08-31 23:14:14,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16131 conditions, 3784 events. 2338/3784 cut-off events. For 8822/9162 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 21979 event pairs, 235 based on Foata normal form. 287/3969 useless extension candidates. Maximal degree in co-relation 16114. Up to 1668 conditions per place. [2023-08-31 23:14:14,080 INFO L137 encePairwiseOnDemand]: 262/269 looper letters, 92 selfloop transitions, 23 changer transitions 13/141 dead transitions. [2023-08-31 23:14:14,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 141 transitions, 1181 flow [2023-08-31 23:14:14,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:14:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:14:14,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1050 transitions. [2023-08-31 23:14:14,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4879182156133829 [2023-08-31 23:14:14,084 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1050 transitions. [2023-08-31 23:14:14,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1050 transitions. [2023-08-31 23:14:14,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:14,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1050 transitions. [2023-08-31 23:14:14,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.25) internal successors, (1050), 8 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:14,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 269.0) internal successors, (2421), 9 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:14,090 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 269.0) internal successors, (2421), 9 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:14,091 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 452 flow. Second operand 8 states and 1050 transitions. [2023-08-31 23:14:14,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 141 transitions, 1181 flow [2023-08-31 23:14:14,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 141 transitions, 1137 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-08-31 23:14:14,210 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 564 flow [2023-08-31 23:14:14,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=564, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2023-08-31 23:14:14,211 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 20 predicate places. [2023-08-31 23:14:14,211 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 564 flow [2023-08-31 23:14:14,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:14,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:14,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:14,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:14:14,213 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:14,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:14,213 INFO L85 PathProgramCache]: Analyzing trace with hash 230789228, now seen corresponding path program 1 times [2023-08-31 23:14:14,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:14,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498581458] [2023-08-31 23:14:14,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:14,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:14,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:14,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:14,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498581458] [2023-08-31 23:14:14,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498581458] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:14,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:14,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:14:14,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909569561] [2023-08-31 23:14:14,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:14,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:14:14,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:14,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:14:14,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:14:14,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 269 [2023-08-31 23:14:14,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 564 flow. Second operand has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:14,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:14,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 269 [2023-08-31 23:14:14,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:15,088 INFO L130 PetriNetUnfolder]: 2220/3556 cut-off events. [2023-08-31 23:14:15,088 INFO L131 PetriNetUnfolder]: For 10059/10245 co-relation queries the response was YES. [2023-08-31 23:14:15,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15429 conditions, 3556 events. 2220/3556 cut-off events. For 10059/10245 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 20572 event pairs, 216 based on Foata normal form. 118/3577 useless extension candidates. Maximal degree in co-relation 15409. Up to 1059 conditions per place. [2023-08-31 23:14:15,115 INFO L137 encePairwiseOnDemand]: 262/269 looper letters, 87 selfloop transitions, 28 changer transitions 13/138 dead transitions. [2023-08-31 23:14:15,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 138 transitions, 1197 flow [2023-08-31 23:14:15,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 23:14:15,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 23:14:15,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1287 transitions. [2023-08-31 23:14:15,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4784386617100372 [2023-08-31 23:14:15,119 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1287 transitions. [2023-08-31 23:14:15,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1287 transitions. [2023-08-31 23:14:15,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:15,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1287 transitions. [2023-08-31 23:14:15,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 128.7) internal successors, (1287), 10 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:15,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 269.0) internal successors, (2959), 11 states have internal predecessors, (2959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:15,129 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 269.0) internal successors, (2959), 11 states have internal predecessors, (2959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:15,129 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 564 flow. Second operand 10 states and 1287 transitions. [2023-08-31 23:14:15,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 138 transitions, 1197 flow [2023-08-31 23:14:15,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 138 transitions, 1065 flow, removed 46 selfloop flow, removed 6 redundant places. [2023-08-31 23:14:15,333 INFO L231 Difference]: Finished difference. Result has 76 places, 64 transitions, 501 flow [2023-08-31 23:14:15,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=501, PETRI_PLACES=76, PETRI_TRANSITIONS=64} [2023-08-31 23:14:15,333 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 26 predicate places. [2023-08-31 23:14:15,333 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 64 transitions, 501 flow [2023-08-31 23:14:15,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:15,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:15,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:15,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:14:15,334 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:15,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:15,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1964627365, now seen corresponding path program 1 times [2023-08-31 23:14:15,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:15,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267418908] [2023-08-31 23:14:15,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:15,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:15,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:15,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:15,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267418908] [2023-08-31 23:14:15,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267418908] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:15,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:15,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:14:15,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200451489] [2023-08-31 23:14:15,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:15,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:14:15,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:15,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:14:15,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:14:15,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 269 [2023-08-31 23:14:15,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 64 transitions, 501 flow. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 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-31 23:14:15,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:15,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 269 [2023-08-31 23:14:15,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:16,142 INFO L130 PetriNetUnfolder]: 4028/6195 cut-off events. [2023-08-31 23:14:16,142 INFO L131 PetriNetUnfolder]: For 19534/19534 co-relation queries the response was YES. [2023-08-31 23:14:16,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26570 conditions, 6195 events. 4028/6195 cut-off events. For 19534/19534 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 34965 event pairs, 409 based on Foata normal form. 1/6196 useless extension candidates. Maximal degree in co-relation 26549. Up to 3336 conditions per place. [2023-08-31 23:14:16,173 INFO L137 encePairwiseOnDemand]: 259/269 looper letters, 107 selfloop transitions, 32 changer transitions 40/179 dead transitions. [2023-08-31 23:14:16,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 179 transitions, 1725 flow [2023-08-31 23:14:16,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:14:16,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:14:16,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 663 transitions. [2023-08-31 23:14:16,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4929368029739777 [2023-08-31 23:14:16,176 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 663 transitions. [2023-08-31 23:14:16,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 663 transitions. [2023-08-31 23:14:16,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:16,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 663 transitions. [2023-08-31 23:14:16,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:16,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:16,180 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:16,181 INFO L175 Difference]: Start difference. First operand has 76 places, 64 transitions, 501 flow. Second operand 5 states and 663 transitions. [2023-08-31 23:14:16,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 179 transitions, 1725 flow [2023-08-31 23:14:16,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 179 transitions, 1462 flow, removed 48 selfloop flow, removed 9 redundant places. [2023-08-31 23:14:16,359 INFO L231 Difference]: Finished difference. Result has 73 places, 75 transitions, 655 flow [2023-08-31 23:14:16,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=655, PETRI_PLACES=73, PETRI_TRANSITIONS=75} [2023-08-31 23:14:16,360 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 23 predicate places. [2023-08-31 23:14:16,360 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 655 flow [2023-08-31 23:14:16,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 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-31 23:14:16,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:16,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:16,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:14:16,361 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:16,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:16,361 INFO L85 PathProgramCache]: Analyzing trace with hash -183242407, now seen corresponding path program 2 times [2023-08-31 23:14:16,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:16,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872315511] [2023-08-31 23:14:16,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:16,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:16,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:16,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:16,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872315511] [2023-08-31 23:14:16,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872315511] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:16,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:16,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:14:16,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114067373] [2023-08-31 23:14:16,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:16,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:14:16,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:16,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:14:16,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:14:16,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 269 [2023-08-31 23:14:16,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 655 flow. Second operand has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:16,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:16,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 269 [2023-08-31 23:14:16,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:17,145 INFO L130 PetriNetUnfolder]: 3018/4702 cut-off events. [2023-08-31 23:14:17,146 INFO L131 PetriNetUnfolder]: For 16685/16685 co-relation queries the response was YES. [2023-08-31 23:14:17,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20950 conditions, 4702 events. 3018/4702 cut-off events. For 16685/16685 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 25394 event pairs, 453 based on Foata normal form. 1/4703 useless extension candidates. Maximal degree in co-relation 20929. Up to 1875 conditions per place. [2023-08-31 23:14:17,172 INFO L137 encePairwiseOnDemand]: 259/269 looper letters, 147 selfloop transitions, 42 changer transitions 0/189 dead transitions. [2023-08-31 23:14:17,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 189 transitions, 1834 flow [2023-08-31 23:14:17,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:14:17,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:14:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 790 transitions. [2023-08-31 23:14:17,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48946716232961585 [2023-08-31 23:14:17,176 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 790 transitions. [2023-08-31 23:14:17,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 790 transitions. [2023-08-31 23:14:17,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:17,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 790 transitions. [2023-08-31 23:14:17,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.66666666666666) internal successors, (790), 6 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:17,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:17,181 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:17,181 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 655 flow. Second operand 6 states and 790 transitions. [2023-08-31 23:14:17,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 189 transitions, 1834 flow [2023-08-31 23:14:17,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 189 transitions, 1810 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-08-31 23:14:17,275 INFO L231 Difference]: Finished difference. Result has 72 places, 100 transitions, 1135 flow [2023-08-31 23:14:17,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1135, PETRI_PLACES=72, PETRI_TRANSITIONS=100} [2023-08-31 23:14:17,276 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 22 predicate places. [2023-08-31 23:14:17,276 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 100 transitions, 1135 flow [2023-08-31 23:14:17,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:17,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:17,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:17,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:14:17,277 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:17,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:17,278 INFO L85 PathProgramCache]: Analyzing trace with hash 246384923, now seen corresponding path program 3 times [2023-08-31 23:14:17,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:17,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999500331] [2023-08-31 23:14:17,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:17,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:17,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:17,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:17,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999500331] [2023-08-31 23:14:17,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999500331] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:17,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:17,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:14:17,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836605812] [2023-08-31 23:14:17,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:17,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:14:17,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:17,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:14:17,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:14:17,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 269 [2023-08-31 23:14:17,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 100 transitions, 1135 flow. Second operand has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:17,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:17,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 269 [2023-08-31 23:14:17,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:18,102 INFO L130 PetriNetUnfolder]: 3627/5715 cut-off events. [2023-08-31 23:14:18,102 INFO L131 PetriNetUnfolder]: For 28827/28827 co-relation queries the response was YES. [2023-08-31 23:14:18,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27573 conditions, 5715 events. 3627/5715 cut-off events. For 28827/28827 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 32544 event pairs, 497 based on Foata normal form. 1/5716 useless extension candidates. Maximal degree in co-relation 27552. Up to 2329 conditions per place. [2023-08-31 23:14:18,144 INFO L137 encePairwiseOnDemand]: 259/269 looper letters, 156 selfloop transitions, 49 changer transitions 0/205 dead transitions. [2023-08-31 23:14:18,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 205 transitions, 2280 flow [2023-08-31 23:14:18,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:14:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:14:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 791 transitions. [2023-08-31 23:14:18,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49008674101610905 [2023-08-31 23:14:18,148 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 791 transitions. [2023-08-31 23:14:18,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 791 transitions. [2023-08-31 23:14:18,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:18,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 791 transitions. [2023-08-31 23:14:18,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:18,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:18,153 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:18,153 INFO L175 Difference]: Start difference. First operand has 72 places, 100 transitions, 1135 flow. Second operand 6 states and 791 transitions. [2023-08-31 23:14:18,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 205 transitions, 2280 flow [2023-08-31 23:14:18,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 205 transitions, 2274 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-31 23:14:18,296 INFO L231 Difference]: Finished difference. Result has 80 places, 115 transitions, 1573 flow [2023-08-31 23:14:18,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1573, PETRI_PLACES=80, PETRI_TRANSITIONS=115} [2023-08-31 23:14:18,297 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 30 predicate places. [2023-08-31 23:14:18,297 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 115 transitions, 1573 flow [2023-08-31 23:14:18,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:18,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:18,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:18,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:14:18,298 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:18,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:18,299 INFO L85 PathProgramCache]: Analyzing trace with hash 2037994897, now seen corresponding path program 4 times [2023-08-31 23:14:18,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:18,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678653722] [2023-08-31 23:14:18,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:18,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:19,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:19,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:19,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678653722] [2023-08-31 23:14:19,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678653722] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:19,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:19,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:14:19,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878272478] [2023-08-31 23:14:19,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:19,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:14:19,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:19,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:14:19,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:14:19,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 269 [2023-08-31 23:14:19,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 115 transitions, 1573 flow. Second operand has 7 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:19,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:19,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 269 [2023-08-31 23:14:19,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:20,163 INFO L130 PetriNetUnfolder]: 3901/6769 cut-off events. [2023-08-31 23:14:20,163 INFO L131 PetriNetUnfolder]: For 36136/36996 co-relation queries the response was YES. [2023-08-31 23:14:20,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31397 conditions, 6769 events. 3901/6769 cut-off events. For 36136/36996 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 48203 event pairs, 579 based on Foata normal form. 190/6880 useless extension candidates. Maximal degree in co-relation 31372. Up to 1656 conditions per place. [2023-08-31 23:14:20,235 INFO L137 encePairwiseOnDemand]: 262/269 looper letters, 182 selfloop transitions, 35 changer transitions 0/251 dead transitions. [2023-08-31 23:14:20,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 251 transitions, 3341 flow [2023-08-31 23:14:20,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:14:20,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:14:20,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1044 transitions. [2023-08-31 23:14:20,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4851301115241636 [2023-08-31 23:14:20,238 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1044 transitions. [2023-08-31 23:14:20,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1044 transitions. [2023-08-31 23:14:20,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:20,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1044 transitions. [2023-08-31 23:14:20,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 130.5) internal successors, (1044), 8 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:20,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 269.0) internal successors, (2421), 9 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:20,244 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 269.0) internal successors, (2421), 9 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:20,244 INFO L175 Difference]: Start difference. First operand has 80 places, 115 transitions, 1573 flow. Second operand 8 states and 1044 transitions. [2023-08-31 23:14:20,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 251 transitions, 3341 flow [2023-08-31 23:14:20,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 251 transitions, 3283 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-31 23:14:20,475 INFO L231 Difference]: Finished difference. Result has 88 places, 134 transitions, 1902 flow [2023-08-31 23:14:20,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=1539, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1902, PETRI_PLACES=88, PETRI_TRANSITIONS=134} [2023-08-31 23:14:20,476 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 38 predicate places. [2023-08-31 23:14:20,476 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 134 transitions, 1902 flow [2023-08-31 23:14:20,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:20,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:20,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:20,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:14:20,477 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:20,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:20,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1709813879, now seen corresponding path program 5 times [2023-08-31 23:14:20,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:20,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052808723] [2023-08-31 23:14:20,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:20,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:14:20,521 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:14:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:14:20,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:14:20,592 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:14:20,593 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:14:20,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:14:20,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:14:20,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:14:20,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:14:20,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:14:20,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:14:20,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:14:20,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:14:20,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:14:20,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:14:20,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:14:20,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:14:20,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:14:20,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:14:20,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:14:20,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:14:20,597 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:20,602 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:14:20,602 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:14:20,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:14:20 BasicIcfg [2023-08-31 23:14:20,679 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:14:20,680 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:14:20,680 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:14:20,680 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:14:20,681 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:13:58" (3/4) ... [2023-08-31 23:14:20,683 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:14:20,683 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:14:20,683 INFO L158 Benchmark]: Toolchain (without parser) took 24065.17ms. Allocated memory was 86.0MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 63.9MB in the beginning and 669.3MB in the end (delta: -605.4MB). Peak memory consumption was 738.7MB. Max. memory is 16.1GB. [2023-08-31 23:14:20,684 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 65.0MB. Free memory is still 43.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:14:20,684 INFO L158 Benchmark]: CACSL2BoogieTranslator took 527.05ms. Allocated memory is still 86.0MB. Free memory was 63.7MB in the beginning and 59.3MB in the end (delta: 4.4MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2023-08-31 23:14:20,684 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.84ms. Allocated memory is still 86.0MB. Free memory was 59.3MB in the beginning and 56.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:14:20,685 INFO L158 Benchmark]: Boogie Preprocessor took 60.88ms. Allocated memory is still 86.0MB. Free memory was 56.7MB in the beginning and 54.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:14:20,685 INFO L158 Benchmark]: RCFGBuilder took 773.75ms. Allocated memory is still 86.0MB. Free memory was 54.2MB in the beginning and 40.5MB in the end (delta: 13.7MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2023-08-31 23:14:20,685 INFO L158 Benchmark]: TraceAbstraction took 22614.82ms. Allocated memory was 86.0MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 39.6MB in the beginning and 669.3MB in the end (delta: -629.6MB). Peak memory consumption was 713.8MB. Max. memory is 16.1GB. [2023-08-31 23:14:20,685 INFO L158 Benchmark]: Witness Printer took 3.19ms. Allocated memory is still 1.4GB. Free memory is still 669.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:14:20,687 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.22ms. Allocated memory is still 65.0MB. Free memory is still 43.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 527.05ms. Allocated memory is still 86.0MB. Free memory was 63.7MB in the beginning and 59.3MB in the end (delta: 4.4MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.84ms. Allocated memory is still 86.0MB. Free memory was 59.3MB in the beginning and 56.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.88ms. Allocated memory is still 86.0MB. Free memory was 56.7MB in the beginning and 54.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 773.75ms. Allocated memory is still 86.0MB. Free memory was 54.2MB in the beginning and 40.5MB in the end (delta: 13.7MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * TraceAbstraction took 22614.82ms. Allocated memory was 86.0MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 39.6MB in the beginning and 669.3MB in the end (delta: -629.6MB). Peak memory consumption was 713.8MB. Max. memory is 16.1GB. * Witness Printer took 3.19ms. Allocated memory is still 1.4GB. Free memory is still 669.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 147 PlacesBefore, 50 PlacesAfterwards, 136 TransitionsBefore, 38 TransitionsAfterwards, 3024 CoEnabledTransitionPairs, 8 FixpointIterations, 46 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 129 TotalNumberOfCompositions, 8476 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4205, independent: 3973, independent conditional: 0, independent unconditional: 3973, dependent: 232, dependent conditional: 0, dependent unconditional: 232, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1644, independent: 1601, independent conditional: 0, independent unconditional: 1601, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4205, independent: 2372, independent conditional: 0, independent unconditional: 2372, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 1644, unknown conditional: 0, unknown unconditional: 1644] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 150, Positive conditional cache size: 0, Positive unconditional cache size: 150, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t525; [L865] FCALL, FORK 0 pthread_create(&t525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t525, ((void *)0), P0, ((void *)0))=-3, t525={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L866] 0 pthread_t t526; [L867] FCALL, FORK 0 pthread_create(&t526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t526, ((void *)0), P1, ((void *)0))=-2, t525={5:0}, t526={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L868] 0 pthread_t t527; [L869] FCALL, FORK 0 pthread_create(&t527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t527, ((void *)0), P2, ((void *)0))=-1, t525={5:0}, t526={6:0}, t527={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L870] 0 pthread_t t528; [L871] FCALL, FORK 0 pthread_create(&t528, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t528, ((void *)0), P3, ((void *)0))=0, t525={5:0}, t526={6:0}, t527={7:0}, t528={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 z$flush_delayed = weak$$choice2 [L826] 4 z$mem_tmp = z [L827] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L828] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L829] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L830] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L831] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L833] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = z [L835] 4 z = z$flush_delayed ? z$mem_tmp : z [L836] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L839] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L843] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L844] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L845] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L846] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L878] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L879] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L880] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L881] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t525={5:0}, t526={6:0}, t527={7:0}, t528={3:0}, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L884] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 871]: 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: 869]: 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: 867]: 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: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 174 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 22.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 821 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 667 mSDsluCounter, 222 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 142 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2199 IncrementalHoareTripleChecker+Invalid, 2286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 80 mSDtfsCounter, 2199 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1902occurred in iteration=14, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 1543 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-31 23:14:20,715 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/mix020.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 b3c17f675455332f72f7dc385a60a0aa293a9aeb1dd45189023ae89322443476 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:14:22,706 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:14:22,708 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:14:22,734 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:14:22,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:14:22,735 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:14:22,736 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:14:22,738 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:14:22,739 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:14:22,740 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:14:22,741 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:14:22,741 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:14:22,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:14:22,742 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:14:22,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:14:22,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:14:22,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:14:22,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:14:22,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:14:22,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:14:22,750 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:14:22,766 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:14:22,768 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:14:22,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:14:22,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:14:22,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:14:22,772 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:14:22,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:14:22,774 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:14:22,775 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:14:22,775 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:14:22,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:14:22,776 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:14:22,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:14:22,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:14:22,778 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:14:22,779 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:14:22,779 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:14:22,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:14:22,789 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:14:22,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:14:22,793 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:14:22,829 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:14:22,829 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:14:22,830 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:14:22,830 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:14:22,831 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:14:22,831 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:14:22,832 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:14:22,832 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:14:22,833 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:14:22,833 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:14:22,833 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:14:22,834 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:14:22,834 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:14:22,834 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:14:22,834 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:14:22,834 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:14:22,834 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:14:22,835 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:14:22,835 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:14:22,835 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:14:22,835 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:14:22,835 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:14:22,835 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:14:22,835 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:14:22,836 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:14:22,836 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:14:22,836 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:14:22,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:14:22,836 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:14:22,836 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:14:22,837 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:14:22,837 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:14:22,837 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:14:22,837 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:14:22,837 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:14:22,837 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:14:22,838 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:14:22,838 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 -> b3c17f675455332f72f7dc385a60a0aa293a9aeb1dd45189023ae89322443476 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:14:23,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:14:23,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:14:23,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:14:23,172 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:14:23,172 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:14:23,173 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix020.opt.i [2023-08-31 23:14:24,256 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:14:24,557 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:14:24,562 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix020.opt.i [2023-08-31 23:14:24,585 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db57b933f/48ec842f473540f29a18d07e11e11c3a/FLAGb221ffd94 [2023-08-31 23:14:24,597 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db57b933f/48ec842f473540f29a18d07e11e11c3a [2023-08-31 23:14:24,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:14:24,600 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:14:24,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:14:24,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:14:24,607 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:14:24,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:14:24" (1/1) ... [2023-08-31 23:14:24,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4af63f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:24, skipping insertion in model container [2023-08-31 23:14:24,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:14:24" (1/1) ... [2023-08-31 23:14:24,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:14:24,663 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:14:24,783 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/mix020.opt.i[944,957] [2023-08-31 23:14:24,993 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:14:25,020 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:14:25,033 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/mix020.opt.i[944,957] [2023-08-31 23:14:25,088 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:14:25,126 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:14:25,126 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:14:25,132 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:14:25,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:25 WrapperNode [2023-08-31 23:14:25,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:14:25,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:14:25,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:14:25,134 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:14:25,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:25" (1/1) ... [2023-08-31 23:14:25,171 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:25" (1/1) ... [2023-08-31 23:14:25,221 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2023-08-31 23:14:25,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:14:25,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:14:25,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:14:25,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:14:25,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:25" (1/1) ... [2023-08-31 23:14:25,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:25" (1/1) ... [2023-08-31 23:14:25,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:25" (1/1) ... [2023-08-31 23:14:25,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:25" (1/1) ... [2023-08-31 23:14:25,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:25" (1/1) ... [2023-08-31 23:14:25,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:25" (1/1) ... [2023-08-31 23:14:25,260 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:25" (1/1) ... [2023-08-31 23:14:25,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:25" (1/1) ... [2023-08-31 23:14:25,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:14:25,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:14:25,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:14:25,266 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:14:25,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:25" (1/1) ... [2023-08-31 23:14:25,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:14:25,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:14:25,294 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:14:25,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:14:25,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:14:25,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:14:25,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:14:25,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:14:25,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:14:25,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:14:25,337 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:14:25,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:14:25,337 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:14:25,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:14:25,337 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:14:25,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:14:25,337 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:14:25,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:14:25,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:14:25,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:14:25,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:14:25,339 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:14:25,532 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:14:25,534 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:14:25,842 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:14:25,990 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:14:25,991 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:14:25,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:14:25 BoogieIcfgContainer [2023-08-31 23:14:25,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:14:25,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:14:25,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:14:25,999 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:14:25,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:14:24" (1/3) ... [2023-08-31 23:14:25,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18afbf14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:14:25, skipping insertion in model container [2023-08-31 23:14:26,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:25" (2/3) ... [2023-08-31 23:14:26,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18afbf14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:14:26, skipping insertion in model container [2023-08-31 23:14:26,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:14:25" (3/3) ... [2023-08-31 23:14:26,001 INFO L112 eAbstractionObserver]: Analyzing ICFG mix020.opt.i [2023-08-31 23:14:26,018 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:14:26,018 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:14:26,018 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:14:26,103 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:14:26,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 302 flow [2023-08-31 23:14:26,222 INFO L130 PetriNetUnfolder]: 2/137 cut-off events. [2023-08-31 23:14:26,223 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:14:26,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-08-31 23:14:26,230 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 141 transitions, 302 flow [2023-08-31 23:14:26,237 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 137 transitions, 286 flow [2023-08-31 23:14:26,240 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:14:26,257 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 137 transitions, 286 flow [2023-08-31 23:14:26,260 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 137 transitions, 286 flow [2023-08-31 23:14:26,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 286 flow [2023-08-31 23:14:26,282 INFO L130 PetriNetUnfolder]: 2/137 cut-off events. [2023-08-31 23:14:26,282 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:14:26,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-08-31 23:14:26,285 INFO L119 LiptonReduction]: Number of co-enabled transitions 3024 [2023-08-31 23:14:32,742 INFO L134 LiptonReduction]: Checked pairs total: 7798 [2023-08-31 23:14:32,742 INFO L136 LiptonReduction]: Total number of compositions: 132 [2023-08-31 23:14:32,753 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:14:32,758 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;@2c2ee88a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:14:32,758 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:14:32,759 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:14:32,760 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:14:32,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:32,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:14:32,761 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:32,765 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:32,765 INFO L85 PathProgramCache]: Analyzing trace with hash 606, now seen corresponding path program 1 times [2023-08-31 23:14:32,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:32,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966017739] [2023-08-31 23:14:32,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:32,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:32,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:32,777 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:14:32,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-31 23:14:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:32,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:14:32,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:32,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:32,850 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:32,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:32,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966017739] [2023-08-31 23:14:32,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966017739] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:32,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:32,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:14:32,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87597641] [2023-08-31 23:14:32,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:32,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:14:32,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:32,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:14:32,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:14:32,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 273 [2023-08-31 23:14:32,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:32,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:32,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 273 [2023-08-31 23:14:32,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:33,807 INFO L130 PetriNetUnfolder]: 4373/6061 cut-off events. [2023-08-31 23:14:33,808 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2023-08-31 23:14:33,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12147 conditions, 6061 events. 4373/6061 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 30591 event pairs, 4373 based on Foata normal form. 0/5337 useless extension candidates. Maximal degree in co-relation 12135. Up to 5983 conditions per place. [2023-08-31 23:14:33,845 INFO L137 encePairwiseOnDemand]: 264/273 looper letters, 26 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2023-08-31 23:14:33,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 122 flow [2023-08-31 23:14:33,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:14:33,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:14:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 291 transitions. [2023-08-31 23:14:33,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532967032967033 [2023-08-31 23:14:33,864 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 291 transitions. [2023-08-31 23:14:33,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 291 transitions. [2023-08-31 23:14:33,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:33,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 291 transitions. [2023-08-31 23:14:33,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:33,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:33,882 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:33,884 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 2 states and 291 transitions. [2023-08-31 23:14:33,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 122 flow [2023-08-31 23:14:33,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:14:33,893 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-08-31 23:14:33,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-08-31 23:14:33,898 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-08-31 23:14:33,899 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-08-31 23:14:33,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:33,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:33,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:33,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-31 23:14:34,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:34,110 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:34,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:34,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1412473913, now seen corresponding path program 1 times [2023-08-31 23:14:34,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:34,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075427875] [2023-08-31 23:14:34,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:34,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:34,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:34,114 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:14:34,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-31 23:14:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:34,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:14:34,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:34,234 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:34,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:34,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075427875] [2023-08-31 23:14:34,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075427875] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:34,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:34,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:14:34,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750679062] [2023-08-31 23:14:34,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:34,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:14:34,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:34,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:14:34,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:14:34,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 273 [2023-08-31 23:14:34,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:34,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:34,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 273 [2023-08-31 23:14:34,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:34,828 INFO L130 PetriNetUnfolder]: 3632/5248 cut-off events. [2023-08-31 23:14:34,828 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:14:34,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10338 conditions, 5248 events. 3632/5248 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 28646 event pairs, 668 based on Foata normal form. 0/4884 useless extension candidates. Maximal degree in co-relation 10335. Up to 3973 conditions per place. [2023-08-31 23:14:34,855 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 34 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-08-31 23:14:34,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 166 flow [2023-08-31 23:14:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:14:34,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:14:34,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-08-31 23:14:34,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2023-08-31 23:14:34,858 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-08-31 23:14:34,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-08-31 23:14:34,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:34,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-08-31 23:14:34,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 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-31 23:14:34,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:34,863 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:34,864 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 3 states and 420 transitions. [2023-08-31 23:14:34,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 166 flow [2023-08-31 23:14:34,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:14:34,865 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2023-08-31 23:14:34,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-31 23:14:34,866 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-08-31 23:14:34,866 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2023-08-31 23:14:34,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:34,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:34,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:34,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-31 23:14:35,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:35,078 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:35,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:35,078 INFO L85 PathProgramCache]: Analyzing trace with hash 177854726, now seen corresponding path program 1 times [2023-08-31 23:14:35,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:35,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169134418] [2023-08-31 23:14:35,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:35,079 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:35,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:35,084 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:14:35,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-31 23:14:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:35,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:14:35,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:35,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:35,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:35,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:35,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169134418] [2023-08-31 23:14:35,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169134418] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:35,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:35,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:14:35,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471099027] [2023-08-31 23:14:35,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:35,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:14:35,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:35,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:14:35,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:14:35,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 273 [2023-08-31 23:14:35,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:35,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:35,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 273 [2023-08-31 23:14:35,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:35,814 INFO L130 PetriNetUnfolder]: 2540/3674 cut-off events. [2023-08-31 23:14:35,814 INFO L131 PetriNetUnfolder]: For 184/184 co-relation queries the response was YES. [2023-08-31 23:14:35,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7626 conditions, 3674 events. 2540/3674 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 18243 event pairs, 492 based on Foata normal form. 180/3719 useless extension candidates. Maximal degree in co-relation 7622. Up to 2887 conditions per place. [2023-08-31 23:14:35,833 INFO L137 encePairwiseOnDemand]: 266/273 looper letters, 36 selfloop transitions, 5 changer transitions 23/67 dead transitions. [2023-08-31 23:14:35,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 67 transitions, 286 flow [2023-08-31 23:14:35,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:14:35,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:14:35,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 661 transitions. [2023-08-31 23:14:35,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48424908424908425 [2023-08-31 23:14:35,837 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 661 transitions. [2023-08-31 23:14:35,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 661 transitions. [2023-08-31 23:14:35,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:35,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 661 transitions. [2023-08-31 23:14:35,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:35,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:35,842 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:35,842 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 5 states and 661 transitions. [2023-08-31 23:14:35,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 67 transitions, 286 flow [2023-08-31 23:14:35,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 67 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:14:35,845 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 107 flow [2023-08-31 23:14:35,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-31 23:14:35,845 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -6 predicate places. [2023-08-31 23:14:35,846 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 107 flow [2023-08-31 23:14:35,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:35,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:35,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:35,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-31 23:14:36,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:36,056 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:36,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:36,057 INFO L85 PathProgramCache]: Analyzing trace with hash -634800118, now seen corresponding path program 1 times [2023-08-31 23:14:36,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:36,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980349919] [2023-08-31 23:14:36,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:36,057 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:36,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:36,058 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:14:36,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-31 23:14:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:36,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:14:36,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:36,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:36,198 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:36,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:36,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980349919] [2023-08-31 23:14:36,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980349919] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:36,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:36,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:14:36,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328960700] [2023-08-31 23:14:36,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:36,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:14:36,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:36,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:14:36,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:14:36,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 273 [2023-08-31 23:14:36,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:36,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:36,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 273 [2023-08-31 23:14:36,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:36,644 INFO L130 PetriNetUnfolder]: 1284/1990 cut-off events. [2023-08-31 23:14:36,644 INFO L131 PetriNetUnfolder]: For 863/863 co-relation queries the response was YES. [2023-08-31 23:14:36,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5495 conditions, 1990 events. 1284/1990 cut-off events. For 863/863 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9447 event pairs, 186 based on Foata normal form. 132/2063 useless extension candidates. Maximal degree in co-relation 5488. Up to 1027 conditions per place. [2023-08-31 23:14:36,657 INFO L137 encePairwiseOnDemand]: 266/273 looper letters, 47 selfloop transitions, 9 changer transitions 23/82 dead transitions. [2023-08-31 23:14:36,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 82 transitions, 427 flow [2023-08-31 23:14:36,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:14:36,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:14:36,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 795 transitions. [2023-08-31 23:14:36,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48534798534798534 [2023-08-31 23:14:36,661 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 795 transitions. [2023-08-31 23:14:36,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 795 transitions. [2023-08-31 23:14:36,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:36,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 795 transitions. [2023-08-31 23:14:36,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:36,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 273.0) internal successors, (1911), 7 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:36,668 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 273.0) internal successors, (1911), 7 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:36,668 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 107 flow. Second operand 6 states and 795 transitions. [2023-08-31 23:14:36,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 82 transitions, 427 flow [2023-08-31 23:14:36,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 420 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:14:36,674 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 172 flow [2023-08-31 23:14:36,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-08-31 23:14:36,675 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-08-31 23:14:36,675 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 172 flow [2023-08-31 23:14:36,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:36,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:36,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:36,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-31 23:14:36,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:36,886 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:36,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:36,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1925457369, now seen corresponding path program 1 times [2023-08-31 23:14:36,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:36,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1640915911] [2023-08-31 23:14:36,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:36,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:36,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:36,888 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:14:36,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-31 23:14:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:36,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:14:36,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:37,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:37,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:37,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1640915911] [2023-08-31 23:14:37,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1640915911] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:37,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:37,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:14:37,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386910578] [2023-08-31 23:14:37,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:37,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:14:37,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:37,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:14:37,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:14:37,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 273 [2023-08-31 23:14:37,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:37,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:37,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 273 [2023-08-31 23:14:37,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:37,450 INFO L130 PetriNetUnfolder]: 660/1070 cut-off events. [2023-08-31 23:14:37,450 INFO L131 PetriNetUnfolder]: For 1216/1216 co-relation queries the response was YES. [2023-08-31 23:14:37,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3496 conditions, 1070 events. 660/1070 cut-off events. For 1216/1216 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4519 event pairs, 124 based on Foata normal form. 56/1111 useless extension candidates. Maximal degree in co-relation 3487. Up to 395 conditions per place. [2023-08-31 23:14:37,458 INFO L137 encePairwiseOnDemand]: 266/273 looper letters, 56 selfloop transitions, 13 changer transitions 23/95 dead transitions. [2023-08-31 23:14:37,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 95 transitions, 588 flow [2023-08-31 23:14:37,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:14:37,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:14:37,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 927 transitions. [2023-08-31 23:14:37,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4850863422291994 [2023-08-31 23:14:37,462 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 927 transitions. [2023-08-31 23:14:37,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 927 transitions. [2023-08-31 23:14:37,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:37,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 927 transitions. [2023-08-31 23:14:37,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.42857142857142) internal successors, (927), 7 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:37,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:37,469 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:37,469 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 172 flow. Second operand 7 states and 927 transitions. [2023-08-31 23:14:37,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 95 transitions, 588 flow [2023-08-31 23:14:37,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 95 transitions, 526 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-31 23:14:37,480 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 222 flow [2023-08-31 23:14:37,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2023-08-31 23:14:37,481 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-08-31 23:14:37,481 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 222 flow [2023-08-31 23:14:37,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:37,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:37,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:37,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-31 23:14:37,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:37,692 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:37,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:37,692 INFO L85 PathProgramCache]: Analyzing trace with hash 214511545, now seen corresponding path program 1 times [2023-08-31 23:14:37,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:37,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833866855] [2023-08-31 23:14:37,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:37,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:37,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:37,694 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:14:37,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-31 23:14:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:37,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 23:14:37,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:37,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:37,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:37,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:37,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833866855] [2023-08-31 23:14:37,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833866855] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:37,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:37,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:14:37,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71209382] [2023-08-31 23:14:37,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:37,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:14:37,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:37,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:14:37,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:14:37,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 273 [2023-08-31 23:14:37,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 121.57142857142857) internal successors, (851), 7 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:37,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:37,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 273 [2023-08-31 23:14:37,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:38,322 INFO L130 PetriNetUnfolder]: 528/839 cut-off events. [2023-08-31 23:14:38,322 INFO L131 PetriNetUnfolder]: For 926/926 co-relation queries the response was YES. [2023-08-31 23:14:38,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2639 conditions, 839 events. 528/839 cut-off events. For 926/926 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3363 event pairs, 119 based on Foata normal form. 12/847 useless extension candidates. Maximal degree in co-relation 2629. Up to 340 conditions per place. [2023-08-31 23:14:38,327 INFO L137 encePairwiseOnDemand]: 266/273 looper letters, 52 selfloop transitions, 17 changer transitions 12/84 dead transitions. [2023-08-31 23:14:38,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 84 transitions, 532 flow [2023-08-31 23:14:38,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:14:38,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:14:38,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1035 transitions. [2023-08-31 23:14:38,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4739010989010989 [2023-08-31 23:14:38,342 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1035 transitions. [2023-08-31 23:14:38,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1035 transitions. [2023-08-31 23:14:38,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:38,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1035 transitions. [2023-08-31 23:14:38,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 129.375) internal successors, (1035), 8 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:38,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 273.0) internal successors, (2457), 9 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:38,355 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 273.0) internal successors, (2457), 9 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:38,355 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 222 flow. Second operand 8 states and 1035 transitions. [2023-08-31 23:14:38,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 84 transitions, 532 flow [2023-08-31 23:14:38,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 84 transitions, 470 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-31 23:14:38,363 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 216 flow [2023-08-31 23:14:38,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-08-31 23:14:38,364 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2023-08-31 23:14:38,364 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 216 flow [2023-08-31 23:14:38,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.57142857142857) internal successors, (851), 7 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:38,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:38,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:38,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-31 23:14:38,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:38,573 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:38,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:38,573 INFO L85 PathProgramCache]: Analyzing trace with hash 991257893, now seen corresponding path program 1 times [2023-08-31 23:14:38,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:38,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507067257] [2023-08-31 23:14:38,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:38,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:38,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:38,575 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:14:38,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-31 23:14:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:38,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:14:38,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:38,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:38,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:38,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:38,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [507067257] [2023-08-31 23:14:38,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [507067257] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:38,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:38,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:14:38,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920036785] [2023-08-31 23:14:38,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:38,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:14:38,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:38,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:14:38,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:14:38,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 273 [2023-08-31 23:14:38,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:38,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:38,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 273 [2023-08-31 23:14:38,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:38,981 INFO L130 PetriNetUnfolder]: 707/1194 cut-off events. [2023-08-31 23:14:38,981 INFO L131 PetriNetUnfolder]: For 1794/1794 co-relation queries the response was YES. [2023-08-31 23:14:38,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3626 conditions, 1194 events. 707/1194 cut-off events. For 1794/1794 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6030 event pairs, 115 based on Foata normal form. 0/1192 useless extension candidates. Maximal degree in co-relation 3615. Up to 653 conditions per place. [2023-08-31 23:14:38,988 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 81 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2023-08-31 23:14:38,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 85 transitions, 657 flow [2023-08-31 23:14:38,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:14:38,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:14:38,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 550 transitions. [2023-08-31 23:14:38,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5036630036630036 [2023-08-31 23:14:38,991 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 550 transitions. [2023-08-31 23:14:38,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 550 transitions. [2023-08-31 23:14:38,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:38,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 550 transitions. [2023-08-31 23:14:38,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:38,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:38,995 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:38,995 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 216 flow. Second operand 4 states and 550 transitions. [2023-08-31 23:14:38,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 85 transitions, 657 flow [2023-08-31 23:14:39,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 85 transitions, 516 flow, removed 38 selfloop flow, removed 7 redundant places. [2023-08-31 23:14:39,003 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 165 flow [2023-08-31 23:14:39,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-08-31 23:14:39,004 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2023-08-31 23:14:39,004 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 165 flow [2023-08-31 23:14:39,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:39,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:39,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:39,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-31 23:14:39,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:39,215 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:39,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:39,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1462034187, now seen corresponding path program 2 times [2023-08-31 23:14:39,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:39,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761313909] [2023-08-31 23:14:39,216 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:14:39,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:39,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:39,218 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:14:39,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-31 23:14:39,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:14:39,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:14:39,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:14:39,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:39,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:39,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:39,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:39,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761313909] [2023-08-31 23:14:39,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761313909] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:39,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:39,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:14:39,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356893430] [2023-08-31 23:14:39,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:39,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:14:39,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:39,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:14:39,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:14:39,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 273 [2023-08-31 23:14:39,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:39,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:39,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 273 [2023-08-31 23:14:39,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:39,610 INFO L130 PetriNetUnfolder]: 1162/1855 cut-off events. [2023-08-31 23:14:39,610 INFO L131 PetriNetUnfolder]: For 1854/1854 co-relation queries the response was YES. [2023-08-31 23:14:39,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5474 conditions, 1855 events. 1162/1855 cut-off events. For 1854/1854 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9550 event pairs, 530 based on Foata normal form. 1/1846 useless extension candidates. Maximal degree in co-relation 5464. Up to 1121 conditions per place. [2023-08-31 23:14:39,621 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 65 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-08-31 23:14:39,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 70 transitions, 430 flow [2023-08-31 23:14:39,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:14:39,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:14:39,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-31 23:14:39,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5115995115995116 [2023-08-31 23:14:39,623 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-31 23:14:39,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-31 23:14:39,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:39,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-31 23:14:39,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:39,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:39,627 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:39,627 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 165 flow. Second operand 3 states and 419 transitions. [2023-08-31 23:14:39,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 70 transitions, 430 flow [2023-08-31 23:14:39,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 70 transitions, 428 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:14:39,641 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 176 flow [2023-08-31 23:14:39,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-08-31 23:14:39,642 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2023-08-31 23:14:39,642 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 176 flow [2023-08-31 23:14:39,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:39,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:39,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:39,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-31 23:14:39,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:39,858 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:39,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:39,859 INFO L85 PathProgramCache]: Analyzing trace with hash -177685313, now seen corresponding path program 3 times [2023-08-31 23:14:39,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:39,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122868762] [2023-08-31 23:14:39,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:14:39,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:39,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:39,860 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:14:39,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-31 23:14:39,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:14:39,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:14:39,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:14:39,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:40,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:40,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:40,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:40,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122868762] [2023-08-31 23:14:40,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122868762] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:40,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:40,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:14:40,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051045241] [2023-08-31 23:14:40,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:40,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:14:40,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:40,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:14:40,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:14:40,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 273 [2023-08-31 23:14:40,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:40,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:40,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 273 [2023-08-31 23:14:40,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:40,415 INFO L130 PetriNetUnfolder]: 1796/2931 cut-off events. [2023-08-31 23:14:40,415 INFO L131 PetriNetUnfolder]: For 2686/2686 co-relation queries the response was YES. [2023-08-31 23:14:40,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8983 conditions, 2931 events. 1796/2931 cut-off events. For 2686/2686 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 16479 event pairs, 343 based on Foata normal form. 1/2921 useless extension candidates. Maximal degree in co-relation 8972. Up to 1543 conditions per place. [2023-08-31 23:14:40,430 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 86 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2023-08-31 23:14:40,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 91 transitions, 569 flow [2023-08-31 23:14:40,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:14:40,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:14:40,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 553 transitions. [2023-08-31 23:14:40,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5064102564102564 [2023-08-31 23:14:40,433 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 553 transitions. [2023-08-31 23:14:40,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 553 transitions. [2023-08-31 23:14:40,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:40,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 553 transitions. [2023-08-31 23:14:40,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.25) internal successors, (553), 4 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-31 23:14:40,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:40,437 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:40,437 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 176 flow. Second operand 4 states and 553 transitions. [2023-08-31 23:14:40,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 91 transitions, 569 flow [2023-08-31 23:14:40,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 91 transitions, 566 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:14:40,476 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 187 flow [2023-08-31 23:14:40,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=187, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2023-08-31 23:14:40,477 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2023-08-31 23:14:40,477 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 187 flow [2023-08-31 23:14:40,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:40,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:40,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:40,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 (10)] Forceful destruction successful, exit code 0 [2023-08-31 23:14:40,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:40,687 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:40,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:40,687 INFO L85 PathProgramCache]: Analyzing trace with hash 11117789, now seen corresponding path program 4 times [2023-08-31 23:14:40,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:40,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952475097] [2023-08-31 23:14:40,688 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:14:40,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:40,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:40,689 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:14:40,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-31 23:14:40,827 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:14:40,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:14:40,827 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:14:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:14:40,985 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:14:40,985 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:14:40,986 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:14:40,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:14:40,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:14:40,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:14:40,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:14:40,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:14:40,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:14:40,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:14:40,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:14:40,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:14:40,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:14:40,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:14:40,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:14:40,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:14:40,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:14:40,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:14:41,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-31 23:14:41,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:41,200 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:41,205 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:14:41,206 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:14:41,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:14:41 BasicIcfg [2023-08-31 23:14:41,270 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:14:41,271 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:14:41,273 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:14:41,273 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:14:41,274 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:14:25" (3/4) ... [2023-08-31 23:14:41,279 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:14:41,279 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:14:41,280 INFO L158 Benchmark]: Toolchain (without parser) took 16679.41ms. Allocated memory was 73.4MB in the beginning and 620.8MB in the end (delta: 547.4MB). Free memory was 49.4MB in the beginning and 378.8MB in the end (delta: -329.4MB). Peak memory consumption was 222.1MB. Max. memory is 16.1GB. [2023-08-31 23:14:41,280 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory was 34.5MB in the beginning and 34.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:14:41,280 INFO L158 Benchmark]: CACSL2BoogieTranslator took 529.32ms. Allocated memory is still 73.4MB. Free memory was 49.2MB in the beginning and 42.9MB in the end (delta: 6.3MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2023-08-31 23:14:41,280 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.60ms. Allocated memory is still 73.4MB. Free memory was 42.9MB in the beginning and 40.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:14:41,281 INFO L158 Benchmark]: Boogie Preprocessor took 41.78ms. Allocated memory is still 73.4MB. Free memory was 40.3MB in the beginning and 37.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:14:41,281 INFO L158 Benchmark]: RCFGBuilder took 727.71ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 37.9MB in the beginning and 49.7MB in the end (delta: -11.8MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2023-08-31 23:14:41,281 INFO L158 Benchmark]: TraceAbstraction took 15274.99ms. Allocated memory was 88.1MB in the beginning and 620.8MB in the end (delta: 532.7MB). Free memory was 49.2MB in the beginning and 379.9MB in the end (delta: -330.7MB). Peak memory consumption was 202.5MB. Max. memory is 16.1GB. [2023-08-31 23:14:41,282 INFO L158 Benchmark]: Witness Printer took 8.20ms. Allocated memory is still 620.8MB. Free memory was 378.9MB in the beginning and 378.8MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:14:41,283 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory was 34.5MB in the beginning and 34.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 529.32ms. Allocated memory is still 73.4MB. Free memory was 49.2MB in the beginning and 42.9MB in the end (delta: 6.3MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.60ms. Allocated memory is still 73.4MB. Free memory was 42.9MB in the beginning and 40.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.78ms. Allocated memory is still 73.4MB. Free memory was 40.3MB in the beginning and 37.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 727.71ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 37.9MB in the beginning and 49.7MB in the end (delta: -11.8MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * TraceAbstraction took 15274.99ms. Allocated memory was 88.1MB in the beginning and 620.8MB in the end (delta: 532.7MB). Free memory was 49.2MB in the beginning and 379.9MB in the end (delta: -330.7MB). Peak memory consumption was 202.5MB. Max. memory is 16.1GB. * Witness Printer took 8.20ms. Allocated memory is still 620.8MB. Free memory was 378.9MB in the beginning and 378.8MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.5s, 148 PlacesBefore, 50 PlacesAfterwards, 137 TransitionsBefore, 38 TransitionsAfterwards, 3024 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 70 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 132 TotalNumberOfCompositions, 7798 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3636, independent: 3432, independent conditional: 0, independent unconditional: 3432, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1652, independent: 1607, independent conditional: 0, independent unconditional: 1607, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3636, independent: 1825, independent conditional: 0, independent unconditional: 1825, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 1652, unknown conditional: 0, unknown unconditional: 1652] , Statistics on independence cache: Total cache size (in pairs): 163, Positive cache size: 147, Positive conditional cache size: 0, Positive unconditional cache size: 147, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t525; [L865] FCALL, FORK 0 pthread_create(&t525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t525, ((void *)0), P0, ((void *)0))=-1, t525={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L866] 0 pthread_t t526; [L867] FCALL, FORK 0 pthread_create(&t526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t526, ((void *)0), P1, ((void *)0))=0, t525={11:0}, t526={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L868] 0 pthread_t t527; [L869] FCALL, FORK 0 pthread_create(&t527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t527, ((void *)0), P2, ((void *)0))=1, t525={11:0}, t526={15:0}, t527={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L870] 0 pthread_t t528; [L871] FCALL, FORK 0 pthread_create(&t528, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t528, ((void *)0), P3, ((void *)0))=2, t525={11:0}, t526={15:0}, t527={7:0}, t528={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 z$flush_delayed = weak$$choice2 [L826] 4 z$mem_tmp = z [L827] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L828] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L829] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L830] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L831] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L833] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = z [L835] 4 z = z$flush_delayed ? z$mem_tmp : z [L836] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L839] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L842] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L843] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L844] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L845] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L846] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L878] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L879] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L880] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L881] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t525={11:0}, t526={15:0}, t527={7:0}, t528={-2147483637:0}, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L884] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 871]: 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: 869]: 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: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 175 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 340 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 274 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1439 IncrementalHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 36 mSDtfsCounter, 1439 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=5, InterpolantAutomatonStates: 42, 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.4s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 138 ConstructedInterpolants, 0 QuantifiedInterpolants, 370 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1274 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:14:41,303 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