./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix031.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix031.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 526111e98fa506d5405af18114114ae6aa9ce1a2e8442e7719052c05a249c119 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:52:09,535 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:52:09,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:52:09,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:52:09,570 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:52:09,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:52:09,578 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:52:09,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:52:09,582 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:52:09,588 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:52:09,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:52:09,590 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:52:09,590 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:52:09,592 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:52:09,593 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:52:09,595 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:52:09,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:52:09,598 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:52:09,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:52:09,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:52:09,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:52:09,622 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:52:09,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:52:09,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:52:09,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:52:09,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:52:09,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:52:09,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:52:09,631 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:52:09,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:52:09,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:52:09,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:52:09,639 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:52:09,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:52:09,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:52:09,642 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:52:09,643 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:52:09,643 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:52:09,643 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:52:09,644 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:52:09,644 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:52:09,646 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 02:52:09,677 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:52:09,677 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:52:09,678 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:52:09,679 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:52:09,679 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:52:09,680 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:52:09,680 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:52:09,680 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:52:09,680 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:52:09,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:52:09,681 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:52:09,682 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:52:09,682 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:52:09,682 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:52:09,682 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:52:09,682 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:52:09,683 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:52:09,683 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:52:09,683 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:52:09,683 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:52:09,683 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:52:09,684 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:52:09,684 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:52:09,684 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:52:09,684 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:52:09,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:52:09,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:52:09,685 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:52:09,685 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:52:09,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:52:09,686 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:52:09,686 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:52:09,686 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:52:09,686 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:52:09,686 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 -> 526111e98fa506d5405af18114114ae6aa9ce1a2e8442e7719052c05a249c119 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 02:52:10,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:52:10,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:52:10,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:52:10,029 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:52:10,029 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:52:10,031 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031.opt.i [2023-08-30 02:52:11,162 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:52:11,448 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:52:11,452 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.opt.i [2023-08-30 02:52:11,474 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2154ee0d/c880ba4d988542f798486824d0115c53/FLAG476166094 [2023-08-30 02:52:11,494 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2154ee0d/c880ba4d988542f798486824d0115c53 [2023-08-30 02:52:11,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:52:11,497 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:52:11,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:52:11,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:52:11,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:52:11,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:52:11" (1/1) ... [2023-08-30 02:52:11,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@223c9368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:11, skipping insertion in model container [2023-08-30 02:52:11,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:52:11" (1/1) ... [2023-08-30 02:52:11,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:52:11,565 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:52:11,706 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.opt.i[987,1000] [2023-08-30 02:52:11,920 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:52:11,932 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:52:11,984 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/mix031.opt.i[987,1000] [2023-08-30 02:52:12,033 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:52:12,061 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:52:12,062 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:52:12,068 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:52:12,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:12 WrapperNode [2023-08-30 02:52:12,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:52:12,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:52:12,070 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:52:12,070 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:52:12,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:12" (1/1) ... [2023-08-30 02:52:12,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:12" (1/1) ... [2023-08-30 02:52:12,137 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 123 [2023-08-30 02:52:12,137 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:52:12,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:52:12,140 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:52:12,140 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:52:12,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:12" (1/1) ... [2023-08-30 02:52:12,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:12" (1/1) ... [2023-08-30 02:52:12,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:12" (1/1) ... [2023-08-30 02:52:12,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:12" (1/1) ... [2023-08-30 02:52:12,171 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:12" (1/1) ... [2023-08-30 02:52:12,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:12" (1/1) ... [2023-08-30 02:52:12,184 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:12" (1/1) ... [2023-08-30 02:52:12,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:12" (1/1) ... [2023-08-30 02:52:12,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:52:12,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:52:12,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:52:12,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:52:12,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:12" (1/1) ... [2023-08-30 02:52:12,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:52:12,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:52:12,234 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 02:52:12,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 02:52:12,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:52:12,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:52:12,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:52:12,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:52:12,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:52:12,266 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:52:12,266 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:52:12,267 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:52:12,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:52:12,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:52:12,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:52:12,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:52:12,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:52:12,269 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:52:12,432 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:52:12,434 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:52:12,710 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:52:12,841 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:52:12,842 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:52:12,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:52:12 BoogieIcfgContainer [2023-08-30 02:52:12,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:52:12,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:52:12,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:52:12,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:52:12,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:52:11" (1/3) ... [2023-08-30 02:52:12,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d7f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:52:12, skipping insertion in model container [2023-08-30 02:52:12,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:12" (2/3) ... [2023-08-30 02:52:12,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d7f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:52:12, skipping insertion in model container [2023-08-30 02:52:12,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:52:12" (3/3) ... [2023-08-30 02:52:12,861 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.opt.i [2023-08-30 02:52:12,877 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:52:12,878 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-30 02:52:12,878 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:52:12,945 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:52:12,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 103 transitions, 216 flow [2023-08-30 02:52:13,028 INFO L130 PetriNetUnfolder]: 2/101 cut-off events. [2023-08-30 02:52:13,031 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:52:13,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 101 events. 2/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2023-08-30 02:52:13,035 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 103 transitions, 216 flow [2023-08-30 02:52:13,038 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 101 transitions, 208 flow [2023-08-30 02:52:13,041 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:52:13,052 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 101 transitions, 208 flow [2023-08-30 02:52:13,056 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 101 transitions, 208 flow [2023-08-30 02:52:13,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 101 transitions, 208 flow [2023-08-30 02:52:13,090 INFO L130 PetriNetUnfolder]: 2/101 cut-off events. [2023-08-30 02:52:13,091 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:52:13,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 101 events. 2/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2023-08-30 02:52:13,096 INFO L119 LiptonReduction]: Number of co-enabled transitions 1384 [2023-08-30 02:52:16,853 INFO L134 LiptonReduction]: Checked pairs total: 3593 [2023-08-30 02:52:16,854 INFO L136 LiptonReduction]: Total number of compositions: 101 [2023-08-30 02:52:16,865 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:52:16,871 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;@a82a1e6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:52:16,871 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-30 02:52:16,874 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:52:16,874 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:52:16,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:16,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:52:16,876 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:16,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:16,882 INFO L85 PathProgramCache]: Analyzing trace with hash 452, now seen corresponding path program 1 times [2023-08-30 02:52:16,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:52:16,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828943444] [2023-08-30 02:52:16,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:16,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:52:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:52:16,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:16,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:52:16,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828943444] [2023-08-30 02:52:16,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828943444] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:16,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:16,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:52:16,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142614363] [2023-08-30 02:52:16,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:16,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:52:16,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:52:17,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:52:17,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:52:17,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 204 [2023-08-30 02:52:17,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 56 flow. Second operand has 2 states, 2 states have (on average 93.5) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:17,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:17,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 204 [2023-08-30 02:52:17,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:17,196 INFO L130 PetriNetUnfolder]: 249/439 cut-off events. [2023-08-30 02:52:17,196 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 02:52:17,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 439 events. 249/439 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1827 event pairs, 249 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 869. Up to 427 conditions per place. [2023-08-30 02:52:17,203 INFO L137 encePairwiseOnDemand]: 199/204 looper letters, 18 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2023-08-30 02:52:17,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 82 flow [2023-08-30 02:52:17,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:52:17,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:52:17,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 209 transitions. [2023-08-30 02:52:17,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5122549019607843 [2023-08-30 02:52:17,219 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 209 transitions. [2023-08-30 02:52:17,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 209 transitions. [2023-08-30 02:52:17,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:17,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 209 transitions. [2023-08-30 02:52:17,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:17,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:17,235 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:17,237 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 56 flow. Second operand 2 states and 209 transitions. [2023-08-30 02:52:17,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 82 flow [2023-08-30 02:52:17,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:52:17,241 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 44 flow [2023-08-30 02:52:17,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2023-08-30 02:52:17,246 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -5 predicate places. [2023-08-30 02:52:17,247 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 44 flow [2023-08-30 02:52:17,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 93.5) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:17,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:17,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:52:17,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:52:17,249 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:17,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:17,250 INFO L85 PathProgramCache]: Analyzing trace with hash 428311602, now seen corresponding path program 1 times [2023-08-30 02:52:17,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:52:17,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220352692] [2023-08-30 02:52:17,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:17,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:52:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:52:17,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:17,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:52:17,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220352692] [2023-08-30 02:52:17,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220352692] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:17,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:17,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:52:17,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653180177] [2023-08-30 02:52:17,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:17,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:52:17,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:52:17,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:52:17,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:52:17,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 204 [2023-08-30 02:52:17,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:17,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:17,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 204 [2023-08-30 02:52:17,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:17,650 INFO L130 PetriNetUnfolder]: 204/382 cut-off events. [2023-08-30 02:52:17,650 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:52:17,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 382 events. 204/382 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1652 event pairs, 24 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 745. Up to 293 conditions per place. [2023-08-30 02:52:17,655 INFO L137 encePairwiseOnDemand]: 201/204 looper letters, 22 selfloop transitions, 2 changer transitions 2/28 dead transitions. [2023-08-30 02:52:17,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 112 flow [2023-08-30 02:52:17,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:52:17,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:52:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2023-08-30 02:52:17,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4950980392156863 [2023-08-30 02:52:17,660 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 303 transitions. [2023-08-30 02:52:17,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 303 transitions. [2023-08-30 02:52:17,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:17,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 303 transitions. [2023-08-30 02:52:17,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:17,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:17,666 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:17,666 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 44 flow. Second operand 3 states and 303 transitions. [2023-08-30 02:52:17,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 112 flow [2023-08-30 02:52:17,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 28 transitions, 112 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:52:17,667 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 44 flow [2023-08-30 02:52:17,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2023-08-30 02:52:17,668 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2023-08-30 02:52:17,668 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 44 flow [2023-08-30 02:52:17,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:17,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:17,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:52:17,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:52:17,669 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:17,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:17,671 INFO L85 PathProgramCache]: Analyzing trace with hash -709361508, now seen corresponding path program 1 times [2023-08-30 02:52:17,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:52:17,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651360703] [2023-08-30 02:52:17,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:17,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:52:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:52:17,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:17,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:52:17,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651360703] [2023-08-30 02:52:17,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651360703] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:17,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:17,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:52:17,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871698401] [2023-08-30 02:52:17,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:17,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:52:17,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:52:17,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:52:17,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:52:18,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 204 [2023-08-30 02:52:18,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:18,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:18,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 204 [2023-08-30 02:52:18,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:18,122 INFO L130 PetriNetUnfolder]: 321/560 cut-off events. [2023-08-30 02:52:18,122 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2023-08-30 02:52:18,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1171 conditions, 560 events. 321/560 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2333 event pairs, 111 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 1167. Up to 419 conditions per place. [2023-08-30 02:52:18,126 INFO L137 encePairwiseOnDemand]: 197/204 looper letters, 27 selfloop transitions, 6 changer transitions 0/33 dead transitions. [2023-08-30 02:52:18,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 33 transitions, 144 flow [2023-08-30 02:52:18,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:52:18,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:52:18,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2023-08-30 02:52:18,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.477124183006536 [2023-08-30 02:52:18,128 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 292 transitions. [2023-08-30 02:52:18,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 292 transitions. [2023-08-30 02:52:18,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:18,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 292 transitions. [2023-08-30 02:52:18,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:18,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:18,132 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:18,132 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 44 flow. Second operand 3 states and 292 transitions. [2023-08-30 02:52:18,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 33 transitions, 144 flow [2023-08-30 02:52:18,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 33 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:52:18,133 INFO L231 Difference]: Finished difference. Result has 28 places, 23 transitions, 86 flow [2023-08-30 02:52:18,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=28, PETRI_TRANSITIONS=23} [2023-08-30 02:52:18,134 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2023-08-30 02:52:18,135 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 23 transitions, 86 flow [2023-08-30 02:52:18,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:18,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:18,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:52:18,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:52:18,136 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:18,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:18,136 INFO L85 PathProgramCache]: Analyzing trace with hash -515369862, now seen corresponding path program 1 times [2023-08-30 02:52:18,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:52:18,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690984705] [2023-08-30 02:52:18,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:18,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:52:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:52:18,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:18,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:52:18,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690984705] [2023-08-30 02:52:18,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690984705] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:18,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:18,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:52:18,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317161667] [2023-08-30 02:52:18,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:18,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:52:18,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:52:18,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:52:18,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:52:18,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 204 [2023-08-30 02:52:18,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 83.6) internal successors, (418), 5 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:18,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:18,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 204 [2023-08-30 02:52:18,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:18,604 INFO L130 PetriNetUnfolder]: 372/698 cut-off events. [2023-08-30 02:52:18,604 INFO L131 PetriNetUnfolder]: For 255/255 co-relation queries the response was YES. [2023-08-30 02:52:18,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1779 conditions, 698 events. 372/698 cut-off events. For 255/255 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3275 event pairs, 259 based on Foata normal form. 51/749 useless extension candidates. Maximal degree in co-relation 1774. Up to 288 conditions per place. [2023-08-30 02:52:18,608 INFO L137 encePairwiseOnDemand]: 199/204 looper letters, 31 selfloop transitions, 3 changer transitions 13/49 dead transitions. [2023-08-30 02:52:18,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 49 transitions, 270 flow [2023-08-30 02:52:18,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:52:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:52:18,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 450 transitions. [2023-08-30 02:52:18,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4411764705882353 [2023-08-30 02:52:18,611 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 450 transitions. [2023-08-30 02:52:18,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 450 transitions. [2023-08-30 02:52:18,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:18,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 450 transitions. [2023-08-30 02:52:18,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:18,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:18,615 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:18,615 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 86 flow. Second operand 5 states and 450 transitions. [2023-08-30 02:52:18,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 49 transitions, 270 flow [2023-08-30 02:52:18,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 49 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:52:18,621 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 94 flow [2023-08-30 02:52:18,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2023-08-30 02:52:18,623 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2023-08-30 02:52:18,623 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 94 flow [2023-08-30 02:52:18,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.6) internal successors, (418), 5 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:18,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:18,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:52:18,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:52:18,624 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:18,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:18,625 INFO L85 PathProgramCache]: Analyzing trace with hash -978275110, now seen corresponding path program 1 times [2023-08-30 02:52:18,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:52:18,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962692052] [2023-08-30 02:52:18,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:18,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:52:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:52:18,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:18,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:52:18,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962692052] [2023-08-30 02:52:18,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962692052] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:18,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:18,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:52:18,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43424785] [2023-08-30 02:52:18,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:18,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:52:18,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:52:18,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:52:18,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:52:18,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 204 [2023-08-30 02:52:18,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:18,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:18,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 204 [2023-08-30 02:52:18,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:18,886 INFO L130 PetriNetUnfolder]: 275/527 cut-off events. [2023-08-30 02:52:18,886 INFO L131 PetriNetUnfolder]: For 143/148 co-relation queries the response was YES. [2023-08-30 02:52:18,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1290 conditions, 527 events. 275/527 cut-off events. For 143/148 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2332 event pairs, 101 based on Foata normal form. 17/543 useless extension candidates. Maximal degree in co-relation 1282. Up to 337 conditions per place. [2023-08-30 02:52:18,890 INFO L137 encePairwiseOnDemand]: 201/204 looper letters, 24 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2023-08-30 02:52:18,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 174 flow [2023-08-30 02:52:18,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:52:18,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:52:18,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2023-08-30 02:52:18,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2023-08-30 02:52:18,892 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 297 transitions. [2023-08-30 02:52:18,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 297 transitions. [2023-08-30 02:52:18,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:18,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 297 transitions. [2023-08-30 02:52:18,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:18,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:18,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:18,894 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 94 flow. Second operand 3 states and 297 transitions. [2023-08-30 02:52:18,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 174 flow [2023-08-30 02:52:18,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 168 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 02:52:18,896 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 101 flow [2023-08-30 02:52:18,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2023-08-30 02:52:18,897 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2023-08-30 02:52:18,897 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 101 flow [2023-08-30 02:52:18,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:18,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:18,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:52:18,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:52:18,898 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:18,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:18,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1201878916, now seen corresponding path program 1 times [2023-08-30 02:52:18,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:52:18,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103885208] [2023-08-30 02:52:18,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:18,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:52:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:52:19,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:19,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:52:19,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103885208] [2023-08-30 02:52:19,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103885208] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:19,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:19,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:52:19,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740761222] [2023-08-30 02:52:19,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:19,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:52:19,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:52:19,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:52:19,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:52:19,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 204 [2023-08-30 02:52:19,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:19,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:19,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 204 [2023-08-30 02:52:19,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:19,194 INFO L130 PetriNetUnfolder]: 309/559 cut-off events. [2023-08-30 02:52:19,195 INFO L131 PetriNetUnfolder]: For 212/212 co-relation queries the response was YES. [2023-08-30 02:52:19,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1477 conditions, 559 events. 309/559 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2319 event pairs, 185 based on Foata normal form. 8/567 useless extension candidates. Maximal degree in co-relation 1469. Up to 414 conditions per place. [2023-08-30 02:52:19,199 INFO L137 encePairwiseOnDemand]: 197/204 looper letters, 29 selfloop transitions, 8 changer transitions 0/37 dead transitions. [2023-08-30 02:52:19,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 210 flow [2023-08-30 02:52:19,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:52:19,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:52:19,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 380 transitions. [2023-08-30 02:52:19,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46568627450980393 [2023-08-30 02:52:19,201 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 380 transitions. [2023-08-30 02:52:19,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 380 transitions. [2023-08-30 02:52:19,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:19,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 380 transitions. [2023-08-30 02:52:19,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:19,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:19,205 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:19,205 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 101 flow. Second operand 4 states and 380 transitions. [2023-08-30 02:52:19,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 210 flow [2023-08-30 02:52:19,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:52:19,207 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 128 flow [2023-08-30 02:52:19,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2023-08-30 02:52:19,208 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2023-08-30 02:52:19,208 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 128 flow [2023-08-30 02:52:19,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:19,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:19,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:52:19,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:52:19,209 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:19,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:19,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1552623268, now seen corresponding path program 1 times [2023-08-30 02:52:19,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:52:19,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779956163] [2023-08-30 02:52:19,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:19,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:52:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:52:19,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:19,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:52:19,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779956163] [2023-08-30 02:52:19,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779956163] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:19,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:19,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:52:19,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74225386] [2023-08-30 02:52:19,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:19,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:52:19,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:52:19,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:52:19,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:52:19,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 204 [2023-08-30 02:52:19,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:19,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:19,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 204 [2023-08-30 02:52:19,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:19,613 INFO L130 PetriNetUnfolder]: 248/491 cut-off events. [2023-08-30 02:52:19,613 INFO L131 PetriNetUnfolder]: For 347/347 co-relation queries the response was YES. [2023-08-30 02:52:19,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1325 conditions, 491 events. 248/491 cut-off events. For 347/347 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2195 event pairs, 64 based on Foata normal form. 19/505 useless extension candidates. Maximal degree in co-relation 1315. Up to 311 conditions per place. [2023-08-30 02:52:19,616 INFO L137 encePairwiseOnDemand]: 199/204 looper letters, 22 selfloop transitions, 5 changer transitions 9/41 dead transitions. [2023-08-30 02:52:19,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 253 flow [2023-08-30 02:52:19,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:52:19,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:52:19,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2023-08-30 02:52:19,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2023-08-30 02:52:19,619 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 442 transitions. [2023-08-30 02:52:19,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 442 transitions. [2023-08-30 02:52:19,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:19,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 442 transitions. [2023-08-30 02:52:19,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:19,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:19,623 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:19,623 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 128 flow. Second operand 5 states and 442 transitions. [2023-08-30 02:52:19,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 253 flow [2023-08-30 02:52:19,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 249 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:52:19,625 INFO L231 Difference]: Finished difference. Result has 41 places, 24 transitions, 134 flow [2023-08-30 02:52:19,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2023-08-30 02:52:19,626 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2023-08-30 02:52:19,626 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 24 transitions, 134 flow [2023-08-30 02:52:19,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:19,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:19,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:52:19,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:52:19,627 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:19,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:19,628 INFO L85 PathProgramCache]: Analyzing trace with hash -383145438, now seen corresponding path program 1 times [2023-08-30 02:52:19,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:52:19,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586746590] [2023-08-30 02:52:19,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:19,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:52:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:52:19,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:19,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:52:19,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586746590] [2023-08-30 02:52:19,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586746590] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:19,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:19,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:52:19,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580366052] [2023-08-30 02:52:19,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:19,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:52:19,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:52:19,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:52:19,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:52:19,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 204 [2023-08-30 02:52:19,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 24 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:19,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:19,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 204 [2023-08-30 02:52:19,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:19,929 INFO L130 PetriNetUnfolder]: 123/286 cut-off events. [2023-08-30 02:52:19,929 INFO L131 PetriNetUnfolder]: For 233/233 co-relation queries the response was YES. [2023-08-30 02:52:19,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 286 events. 123/286 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1280 event pairs, 29 based on Foata normal form. 42/323 useless extension candidates. Maximal degree in co-relation 807. Up to 141 conditions per place. [2023-08-30 02:52:19,931 INFO L137 encePairwiseOnDemand]: 199/204 looper letters, 30 selfloop transitions, 5 changer transitions 9/49 dead transitions. [2023-08-30 02:52:19,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 311 flow [2023-08-30 02:52:19,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:52:19,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:52:19,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2023-08-30 02:52:19,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4774509803921569 [2023-08-30 02:52:19,933 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 487 transitions. [2023-08-30 02:52:19,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 487 transitions. [2023-08-30 02:52:19,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:19,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 487 transitions. [2023-08-30 02:52:19,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.4) internal successors, (487), 5 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-30 02:52:19,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:19,937 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:19,937 INFO L175 Difference]: Start difference. First operand has 41 places, 24 transitions, 134 flow. Second operand 5 states and 487 transitions. [2023-08-30 02:52:19,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 311 flow [2023-08-30 02:52:19,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 282 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-30 02:52:19,940 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 154 flow [2023-08-30 02:52:19,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-30 02:52:19,940 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2023-08-30 02:52:19,941 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 154 flow [2023-08-30 02:52:19,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:19,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:19,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:52:19,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:52:19,942 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:19,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:19,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1055697480, now seen corresponding path program 1 times [2023-08-30 02:52:19,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:52:19,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053590708] [2023-08-30 02:52:19,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:19,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:52:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:52:20,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:20,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:52:20,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053590708] [2023-08-30 02:52:20,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053590708] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:20,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:20,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:52:20,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292249034] [2023-08-30 02:52:20,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:20,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:52:20,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:52:20,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:52:20,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:52:20,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 204 [2023-08-30 02:52:20,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:20,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:20,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 204 [2023-08-30 02:52:20,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:20,284 INFO L130 PetriNetUnfolder]: 77/191 cut-off events. [2023-08-30 02:52:20,285 INFO L131 PetriNetUnfolder]: For 168/168 co-relation queries the response was YES. [2023-08-30 02:52:20,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 191 events. 77/191 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 782 event pairs, 16 based on Foata normal form. 16/206 useless extension candidates. Maximal degree in co-relation 631. Up to 62 conditions per place. [2023-08-30 02:52:20,286 INFO L137 encePairwiseOnDemand]: 199/204 looper letters, 27 selfloop transitions, 8 changer transitions 8/47 dead transitions. [2023-08-30 02:52:20,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 305 flow [2023-08-30 02:52:20,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:52:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:52:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 665 transitions. [2023-08-30 02:52:20,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46568627450980393 [2023-08-30 02:52:20,289 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 665 transitions. [2023-08-30 02:52:20,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 665 transitions. [2023-08-30 02:52:20,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:20,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 665 transitions. [2023-08-30 02:52:20,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:20,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:20,294 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:20,294 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 154 flow. Second operand 7 states and 665 transitions. [2023-08-30 02:52:20,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 305 flow [2023-08-30 02:52:20,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 47 transitions, 272 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-30 02:52:20,296 INFO L231 Difference]: Finished difference. Result has 47 places, 27 transitions, 151 flow [2023-08-30 02:52:20,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=151, PETRI_PLACES=47, PETRI_TRANSITIONS=27} [2023-08-30 02:52:20,297 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 16 predicate places. [2023-08-30 02:52:20,297 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 27 transitions, 151 flow [2023-08-30 02:52:20,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:20,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:20,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:52:20,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:52:20,298 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:20,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:20,298 INFO L85 PathProgramCache]: Analyzing trace with hash 36252710, now seen corresponding path program 1 times [2023-08-30 02:52:20,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:52:20,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856721479] [2023-08-30 02:52:20,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:20,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:52:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:52:20,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:20,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:52:20,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856721479] [2023-08-30 02:52:20,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856721479] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:20,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:20,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:52:20,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103924317] [2023-08-30 02:52:20,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:20,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:52:20,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:52:20,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:52:20,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:52:20,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 204 [2023-08-30 02:52:20,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 27 transitions, 151 flow. Second operand has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:20,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:20,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 204 [2023-08-30 02:52:20,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:20,661 INFO L130 PetriNetUnfolder]: 120/284 cut-off events. [2023-08-30 02:52:20,661 INFO L131 PetriNetUnfolder]: For 573/573 co-relation queries the response was YES. [2023-08-30 02:52:20,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1062 conditions, 284 events. 120/284 cut-off events. For 573/573 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1262 event pairs, 24 based on Foata normal form. 2/286 useless extension candidates. Maximal degree in co-relation 1048. Up to 180 conditions per place. [2023-08-30 02:52:20,663 INFO L137 encePairwiseOnDemand]: 196/204 looper letters, 33 selfloop transitions, 11 changer transitions 10/54 dead transitions. [2023-08-30 02:52:20,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 54 transitions, 420 flow [2023-08-30 02:52:20,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:52:20,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:52:20,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2023-08-30 02:52:20,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4519607843137255 [2023-08-30 02:52:20,665 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 461 transitions. [2023-08-30 02:52:20,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 461 transitions. [2023-08-30 02:52:20,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:20,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 461 transitions. [2023-08-30 02:52:20,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:20,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:20,669 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:20,669 INFO L175 Difference]: Start difference. First operand has 47 places, 27 transitions, 151 flow. Second operand 5 states and 461 transitions. [2023-08-30 02:52:20,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 54 transitions, 420 flow [2023-08-30 02:52:20,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 363 flow, removed 13 selfloop flow, removed 6 redundant places. [2023-08-30 02:52:20,673 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 180 flow [2023-08-30 02:52:20,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=180, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2023-08-30 02:52:20,675 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2023-08-30 02:52:20,675 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 180 flow [2023-08-30 02:52:20,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:20,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:20,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:52:20,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:52:20,676 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:20,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:20,676 INFO L85 PathProgramCache]: Analyzing trace with hash 762781826, now seen corresponding path program 2 times [2023-08-30 02:52:20,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:52:20,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407711715] [2023-08-30 02:52:20,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:20,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:52:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:52:20,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:20,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:52:20,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407711715] [2023-08-30 02:52:20,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407711715] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:20,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:20,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:52:20,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917700999] [2023-08-30 02:52:20,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:20,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:52:20,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:52:20,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:52:20,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:52:20,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 204 [2023-08-30 02:52:20,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:20,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:20,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 204 [2023-08-30 02:52:20,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:21,005 INFO L130 PetriNetUnfolder]: 43/143 cut-off events. [2023-08-30 02:52:21,006 INFO L131 PetriNetUnfolder]: For 168/171 co-relation queries the response was YES. [2023-08-30 02:52:21,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 143 events. 43/143 cut-off events. For 168/171 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 558 event pairs, 16 based on Foata normal form. 3/145 useless extension candidates. Maximal degree in co-relation 519. Up to 64 conditions per place. [2023-08-30 02:52:21,007 INFO L137 encePairwiseOnDemand]: 201/204 looper letters, 33 selfloop transitions, 3 changer transitions 5/43 dead transitions. [2023-08-30 02:52:21,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 318 flow [2023-08-30 02:52:21,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:52:21,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:52:21,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 387 transitions. [2023-08-30 02:52:21,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742647058823529 [2023-08-30 02:52:21,010 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 387 transitions. [2023-08-30 02:52:21,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 387 transitions. [2023-08-30 02:52:21,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:21,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 387 transitions. [2023-08-30 02:52:21,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.75) internal successors, (387), 4 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-30 02:52:21,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:21,015 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:21,015 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 180 flow. Second operand 4 states and 387 transitions. [2023-08-30 02:52:21,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 318 flow [2023-08-30 02:52:21,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 310 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-30 02:52:21,018 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 159 flow [2023-08-30 02:52:21,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2023-08-30 02:52:21,018 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 14 predicate places. [2023-08-30 02:52:21,019 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 159 flow [2023-08-30 02:52:21,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:21,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:21,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:52:21,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 02:52:21,020 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:21,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:21,020 INFO L85 PathProgramCache]: Analyzing trace with hash -125320186, now seen corresponding path program 3 times [2023-08-30 02:52:21,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:52:21,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401458714] [2023-08-30 02:52:21,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:21,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:52:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:52:21,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:21,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:52:21,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401458714] [2023-08-30 02:52:21,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401458714] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:21,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:21,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:52:21,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577313624] [2023-08-30 02:52:21,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:21,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:52:21,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:52:21,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:52:21,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:52:21,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 204 [2023-08-30 02:52:21,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 27 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:21,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:21,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 204 [2023-08-30 02:52:21,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:21,780 INFO L130 PetriNetUnfolder]: 35/143 cut-off events. [2023-08-30 02:52:21,781 INFO L131 PetriNetUnfolder]: For 234/234 co-relation queries the response was YES. [2023-08-30 02:52:21,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 143 events. 35/143 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 594 event pairs, 7 based on Foata normal form. 1/144 useless extension candidates. Maximal degree in co-relation 522. Up to 51 conditions per place. [2023-08-30 02:52:21,782 INFO L137 encePairwiseOnDemand]: 195/204 looper letters, 29 selfloop transitions, 11 changer transitions 4/44 dead transitions. [2023-08-30 02:52:21,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 44 transitions, 344 flow [2023-08-30 02:52:21,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:52:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:52:21,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 685 transitions. [2023-08-30 02:52:21,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41973039215686275 [2023-08-30 02:52:21,785 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 685 transitions. [2023-08-30 02:52:21,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 685 transitions. [2023-08-30 02:52:21,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:21,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 685 transitions. [2023-08-30 02:52:21,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 85.625) internal successors, (685), 8 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:21,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 204.0) internal successors, (1836), 9 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:21,791 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 204.0) internal successors, (1836), 9 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:21,791 INFO L175 Difference]: Start difference. First operand has 45 places, 27 transitions, 159 flow. Second operand 8 states and 685 transitions. [2023-08-30 02:52:21,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 44 transitions, 344 flow [2023-08-30 02:52:21,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 44 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:52:21,794 INFO L231 Difference]: Finished difference. Result has 53 places, 31 transitions, 218 flow [2023-08-30 02:52:21,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=218, PETRI_PLACES=53, PETRI_TRANSITIONS=31} [2023-08-30 02:52:21,795 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 22 predicate places. [2023-08-30 02:52:21,796 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 31 transitions, 218 flow [2023-08-30 02:52:21,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:21,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:21,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:52:21,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 02:52:21,797 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:21,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:21,797 INFO L85 PathProgramCache]: Analyzing trace with hash 377357598, now seen corresponding path program 4 times [2023-08-30 02:52:21,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:52:21,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471820537] [2023-08-30 02:52:21,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:21,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:52:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:52:21,835 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:52:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:52:21,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:52:21,895 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:52:21,896 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-08-30 02:52:21,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-08-30 02:52:21,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-30 02:52:21,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-08-30 02:52:21,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-30 02:52:21,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-30 02:52:21,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-30 02:52:21,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-08-30 02:52:21,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-08-30 02:52:21,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-30 02:52:21,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 02:52:21,900 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:52:21,907 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:52:21,907 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:52:21,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:52:21 BasicIcfg [2023-08-30 02:52:21,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:52:21,956 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:52:21,956 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:52:21,956 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:52:21,956 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:52:12" (3/4) ... [2023-08-30 02:52:21,959 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:52:21,959 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:52:21,959 INFO L158 Benchmark]: Toolchain (without parser) took 10461.92ms. Allocated memory was 71.3MB in the beginning and 201.3MB in the end (delta: 130.0MB). Free memory was 48.1MB in the beginning and 154.7MB in the end (delta: -106.6MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2023-08-30 02:52:21,960 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 54.5MB. Free memory was 32.5MB in the beginning and 32.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:52:21,960 INFO L158 Benchmark]: CACSL2BoogieTranslator took 570.33ms. Allocated memory is still 71.3MB. Free memory was 47.9MB in the beginning and 42.4MB in the end (delta: 5.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 02:52:21,960 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.18ms. Allocated memory is still 71.3MB. Free memory was 42.4MB in the beginning and 40.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:52:21,960 INFO L158 Benchmark]: Boogie Preprocessor took 54.96ms. Allocated memory is still 71.3MB. Free memory was 40.0MB in the beginning and 38.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:52:21,961 INFO L158 Benchmark]: RCFGBuilder took 653.96ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 38.2MB in the beginning and 61.3MB in the end (delta: -23.1MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2023-08-30 02:52:21,961 INFO L158 Benchmark]: TraceAbstraction took 9104.19ms. Allocated memory was 86.0MB in the beginning and 201.3MB in the end (delta: 115.3MB). Free memory was 60.6MB in the beginning and 155.8MB in the end (delta: -95.2MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2023-08-30 02:52:21,961 INFO L158 Benchmark]: Witness Printer took 3.09ms. Allocated memory is still 201.3MB. Free memory was 155.8MB in the beginning and 154.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:52:21,962 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.19ms. Allocated memory is still 54.5MB. Free memory was 32.5MB in the beginning and 32.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 570.33ms. Allocated memory is still 71.3MB. Free memory was 47.9MB in the beginning and 42.4MB in the end (delta: 5.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.18ms. Allocated memory is still 71.3MB. Free memory was 42.4MB in the beginning and 40.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.96ms. Allocated memory is still 71.3MB. Free memory was 40.0MB in the beginning and 38.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 653.96ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 38.2MB in the beginning and 61.3MB in the end (delta: -23.1MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9104.19ms. Allocated memory was 86.0MB in the beginning and 201.3MB in the end (delta: 115.3MB). Free memory was 60.6MB in the beginning and 155.8MB in the end (delta: -95.2MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * Witness Printer took 3.09ms. Allocated memory is still 201.3MB. Free memory was 155.8MB in the beginning and 154.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 106 PlacesBefore, 31 PlacesAfterwards, 101 TransitionsBefore, 25 TransitionsAfterwards, 1384 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 101 TotalNumberOfCompositions, 3593 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1740, independent: 1590, independent conditional: 0, independent unconditional: 1590, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 784, independent: 755, independent conditional: 0, independent unconditional: 755, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1740, independent: 835, independent conditional: 0, independent unconditional: 835, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 784, unknown conditional: 0, unknown unconditional: 784] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff1_thd0; [L732] 0 _Bool y$r_buff1_thd1; [L733] 0 _Bool y$r_buff1_thd2; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L823] 0 pthread_t t835; [L824] FCALL, FORK 0 pthread_create(&t835, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t835, ((void *)0), P0, ((void *)0))=-2, t835={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t836; [L826] FCALL, FORK 0 pthread_create(&t836, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t836, ((void *)0), P1, ((void *)0))=-1, t835={5:0}, t836={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L781] 2 y$w_buff1 = y$w_buff0 [L782] 2 y$w_buff0 = 1 [L783] 2 y$w_buff1_used = y$w_buff0_used [L784] 2 y$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L786] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L787] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L788] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L789] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L792] 2 z = 1 [L795] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L798] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L747] 1 a = 1 [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 y$flush_delayed = weak$$choice2 [L759] 1 y$mem_tmp = y [L760] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L761] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L762] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L763] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L764] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L766] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EBX = y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 2 return 0; [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L830] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L830] RET 0 assume_abort_if_not(main$tmp_guard0) [L832] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835={5:0}, t836={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L841] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: 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: 821]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 824]: 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 5 procedures, 124 locations, 10 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: 8.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 439 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 287 mSDsluCounter, 151 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1020 IncrementalHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 64 mSDtfsCounter, 1020 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=12, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 137 NumberOfCodeBlocks, 137 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 829 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 02:52:21,988 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/mix031.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 526111e98fa506d5405af18114114ae6aa9ce1a2e8442e7719052c05a249c119 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:52:23,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:52:23,956 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:52:23,997 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:52:23,997 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:52:24,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:52:24,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:52:24,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:52:24,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:52:24,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:52:24,011 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:52:24,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:52:24,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:52:24,016 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:52:24,017 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:52:24,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:52:24,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:52:24,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:52:24,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:52:24,030 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:52:24,031 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:52:24,039 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:52:24,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:52:24,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:52:24,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:52:24,048 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:52:24,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:52:24,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:52:24,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:52:24,051 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:52:24,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:52:24,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:52:24,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:52:24,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:52:24,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:52:24,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:52:24,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:52:24,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:52:24,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:52:24,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:52:24,058 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:52:24,059 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 02:52:24,092 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:52:24,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:52:24,094 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:52:24,094 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:52:24,095 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:52:24,095 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:52:24,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:52:24,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:52:24,096 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:52:24,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:52:24,097 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:52:24,097 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:52:24,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:52:24,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:52:24,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:52:24,097 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:52:24,098 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:52:24,098 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:52:24,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:52:24,098 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:52:24,098 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 02:52:24,098 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 02:52:24,098 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:52:24,099 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:52:24,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:52:24,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:52:24,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:52:24,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:52:24,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:52:24,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:52:24,100 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 02:52:24,100 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 02:52:24,100 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:52:24,100 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:52:24,100 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:52:24,101 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 02:52:24,101 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:52:24,101 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 -> 526111e98fa506d5405af18114114ae6aa9ce1a2e8442e7719052c05a249c119 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 02:52:24,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:52:24,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:52:24,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:52:24,441 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:52:24,442 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:52:24,443 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031.opt.i [2023-08-30 02:52:25,668 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:52:25,916 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:52:25,916 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.opt.i [2023-08-30 02:52:25,930 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f027a73cd/b18d3ec24ce44f81bbd9310c49414d24/FLAGb8058edc7 [2023-08-30 02:52:25,945 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f027a73cd/b18d3ec24ce44f81bbd9310c49414d24 [2023-08-30 02:52:25,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:52:25,948 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:52:25,949 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:52:25,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:52:25,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:52:25,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:52:25" (1/1) ... [2023-08-30 02:52:25,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1941587b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:25, skipping insertion in model container [2023-08-30 02:52:25,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:52:25" (1/1) ... [2023-08-30 02:52:25,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:52:25,989 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:52:26,126 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/mix031.opt.i[987,1000] [2023-08-30 02:52:26,331 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:52:26,347 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:52:26,360 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/mix031.opt.i[987,1000] [2023-08-30 02:52:26,390 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:52:26,438 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:52:26,439 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:52:26,445 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:52:26,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:26 WrapperNode [2023-08-30 02:52:26,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:52:26,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:52:26,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:52:26,447 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:52:26,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:26" (1/1) ... [2023-08-30 02:52:26,487 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:26" (1/1) ... [2023-08-30 02:52:26,524 INFO L138 Inliner]: procedures = 178, calls = 49, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 124 [2023-08-30 02:52:26,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:52:26,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:52:26,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:52:26,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:52:26,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:26" (1/1) ... [2023-08-30 02:52:26,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:26" (1/1) ... [2023-08-30 02:52:26,546 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:26" (1/1) ... [2023-08-30 02:52:26,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:26" (1/1) ... [2023-08-30 02:52:26,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:26" (1/1) ... [2023-08-30 02:52:26,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:26" (1/1) ... [2023-08-30 02:52:26,564 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:26" (1/1) ... [2023-08-30 02:52:26,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:26" (1/1) ... [2023-08-30 02:52:26,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:52:26,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:52:26,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:52:26,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:52:26,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:26" (1/1) ... [2023-08-30 02:52:26,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:52:26,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:52:26,614 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 02:52:26,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 02:52:26,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:52:26,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:52:26,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:52:26,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:52:26,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 02:52:26,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 02:52:26,655 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:52:26,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:52:26,655 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:52:26,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:52:26,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:52:26,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:52:26,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:52:26,657 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:52:26,779 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:52:26,781 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:52:27,120 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:52:27,226 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:52:27,227 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:52:27,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:52:27 BoogieIcfgContainer [2023-08-30 02:52:27,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:52:27,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:52:27,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:52:27,234 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:52:27,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:52:25" (1/3) ... [2023-08-30 02:52:27,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13fa0e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:52:27, skipping insertion in model container [2023-08-30 02:52:27,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:26" (2/3) ... [2023-08-30 02:52:27,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13fa0e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:52:27, skipping insertion in model container [2023-08-30 02:52:27,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:52:27" (3/3) ... [2023-08-30 02:52:27,236 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.opt.i [2023-08-30 02:52:27,252 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:52:27,252 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-30 02:52:27,253 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:52:27,323 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:52:27,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 104 transitions, 218 flow [2023-08-30 02:52:27,436 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2023-08-30 02:52:27,436 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:52:27,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2023-08-30 02:52:27,442 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 104 transitions, 218 flow [2023-08-30 02:52:27,447 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 102 transitions, 210 flow [2023-08-30 02:52:27,451 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:52:27,465 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 102 transitions, 210 flow [2023-08-30 02:52:27,469 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 102 transitions, 210 flow [2023-08-30 02:52:27,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 102 transitions, 210 flow [2023-08-30 02:52:27,505 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2023-08-30 02:52:27,505 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:52:27,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2023-08-30 02:52:27,508 INFO L119 LiptonReduction]: Number of co-enabled transitions 1384 [2023-08-30 02:52:32,606 INFO L134 LiptonReduction]: Checked pairs total: 3593 [2023-08-30 02:52:32,607 INFO L136 LiptonReduction]: Total number of compositions: 108 [2023-08-30 02:52:32,620 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:52:32,625 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;@707debf7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:52:32,626 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-30 02:52:32,627 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:52:32,627 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:52:32,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:32,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:52:32,629 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:32,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:32,633 INFO L85 PathProgramCache]: Analyzing trace with hash 460, now seen corresponding path program 1 times [2023-08-30 02:52:32,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:52:32,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367881798] [2023-08-30 02:52:32,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:32,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:52:32,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:52:32,657 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:52:32,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-30 02:52:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:52:32,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 02:52:32,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:52:32,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:32,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:52:32,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:52:32,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367881798] [2023-08-30 02:52:32,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367881798] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:32,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:32,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:52:32,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277666536] [2023-08-30 02:52:32,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:32,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:52:32,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:52:32,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:52:32,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:52:32,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 212 [2023-08-30 02:52:32,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 56 flow. Second operand has 2 states, 2 states have (on average 94.5) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:32,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:32,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 212 [2023-08-30 02:52:32,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:33,019 INFO L130 PetriNetUnfolder]: 249/437 cut-off events. [2023-08-30 02:52:33,019 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 02:52:33,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 437 events. 249/437 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1837 event pairs, 249 based on Foata normal form. 0/351 useless extension candidates. Maximal degree in co-relation 867. Up to 427 conditions per place. [2023-08-30 02:52:33,030 INFO L137 encePairwiseOnDemand]: 207/212 looper letters, 18 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2023-08-30 02:52:33,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 82 flow [2023-08-30 02:52:33,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:52:33,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:52:33,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 211 transitions. [2023-08-30 02:52:33,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49764150943396224 [2023-08-30 02:52:33,069 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 211 transitions. [2023-08-30 02:52:33,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 211 transitions. [2023-08-30 02:52:33,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:33,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 211 transitions. [2023-08-30 02:52:33,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:33,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:33,105 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:33,106 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 56 flow. Second operand 2 states and 211 transitions. [2023-08-30 02:52:33,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 82 flow [2023-08-30 02:52:33,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:52:33,110 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 44 flow [2023-08-30 02:52:33,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2023-08-30 02:52:33,119 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -5 predicate places. [2023-08-30 02:52:33,120 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 44 flow [2023-08-30 02:52:33,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 94.5) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:33,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:33,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:52:33,133 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-30 02:52:33,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:52:33,330 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:33,331 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:33,331 INFO L85 PathProgramCache]: Analyzing trace with hash 435768065, now seen corresponding path program 1 times [2023-08-30 02:52:33,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:52:33,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106027125] [2023-08-30 02:52:33,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:33,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:52:33,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:52:33,333 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:52:33,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-30 02:52:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:52:33,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:52:33,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:52:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:33,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:52:33,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:52:33,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106027125] [2023-08-30 02:52:33,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [106027125] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:33,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:33,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:52:33,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534311685] [2023-08-30 02:52:33,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:33,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:52:33,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:52:33,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:52:33,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:52:33,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 212 [2023-08-30 02:52:33,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:33,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:33,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 212 [2023-08-30 02:52:33,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:33,570 INFO L130 PetriNetUnfolder]: 204/383 cut-off events. [2023-08-30 02:52:33,570 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:52:33,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 383 events. 204/383 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1679 event pairs, 24 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 746. Up to 293 conditions per place. [2023-08-30 02:52:33,578 INFO L137 encePairwiseOnDemand]: 209/212 looper letters, 22 selfloop transitions, 2 changer transitions 2/28 dead transitions. [2023-08-30 02:52:33,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 112 flow [2023-08-30 02:52:33,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:52:33,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:52:33,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2023-08-30 02:52:33,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4811320754716981 [2023-08-30 02:52:33,586 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 306 transitions. [2023-08-30 02:52:33,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 306 transitions. [2023-08-30 02:52:33,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:33,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 306 transitions. [2023-08-30 02:52:33,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:33,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:33,595 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:33,595 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 44 flow. Second operand 3 states and 306 transitions. [2023-08-30 02:52:33,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 112 flow [2023-08-30 02:52:33,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 28 transitions, 112 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:52:33,597 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 44 flow [2023-08-30 02:52:33,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2023-08-30 02:52:33,598 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2023-08-30 02:52:33,598 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 44 flow [2023-08-30 02:52:33,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:33,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:33,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:52:33,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-30 02:52:33,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:52:33,809 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:33,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:33,809 INFO L85 PathProgramCache]: Analyzing trace with hash -2133623371, now seen corresponding path program 1 times [2023-08-30 02:52:33,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:52:33,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149568003] [2023-08-30 02:52:33,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:33,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:52:33,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:52:33,812 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:52:33,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-30 02:52:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:52:33,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:52:33,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:52:33,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:33,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:52:33,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:52:33,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [149568003] [2023-08-30 02:52:33,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [149568003] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:33,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:33,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:52:33,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121553813] [2023-08-30 02:52:33,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:33,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:52:33,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:52:33,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:52:33,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:52:33,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 212 [2023-08-30 02:52:33,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:33,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:33,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 212 [2023-08-30 02:52:33,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:34,113 INFO L130 PetriNetUnfolder]: 76/170 cut-off events. [2023-08-30 02:52:34,113 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-08-30 02:52:34,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 170 events. 76/170 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 631 event pairs, 15 based on Foata normal form. 20/181 useless extension candidates. Maximal degree in co-relation 359. Up to 94 conditions per place. [2023-08-30 02:52:34,116 INFO L137 encePairwiseOnDemand]: 207/212 looper letters, 22 selfloop transitions, 3 changer transitions 15/42 dead transitions. [2023-08-30 02:52:34,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 42 transitions, 180 flow [2023-08-30 02:52:34,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:52:34,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:52:34,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 492 transitions. [2023-08-30 02:52:34,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4641509433962264 [2023-08-30 02:52:34,119 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 492 transitions. [2023-08-30 02:52:34,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 492 transitions. [2023-08-30 02:52:34,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:34,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 492 transitions. [2023-08-30 02:52:34,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:34,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:34,124 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:34,125 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 44 flow. Second operand 5 states and 492 transitions. [2023-08-30 02:52:34,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 42 transitions, 180 flow [2023-08-30 02:52:34,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 42 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:52:34,126 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 67 flow [2023-08-30 02:52:34,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=67, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2023-08-30 02:52:34,128 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-08-30 02:52:34,128 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 67 flow [2023-08-30 02:52:34,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:34,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:34,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:52:34,140 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-30 02:52:34,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:52:34,338 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:34,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:34,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1271281438, now seen corresponding path program 1 times [2023-08-30 02:52:34,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:52:34,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748438439] [2023-08-30 02:52:34,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:34,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:52:34,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:52:34,341 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:52:34,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-30 02:52:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:52:34,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:52:34,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:52:34,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:34,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:52:34,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:52:34,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748438439] [2023-08-30 02:52:34,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748438439] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:34,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:34,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:52:34,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311330016] [2023-08-30 02:52:34,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:34,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:52:34,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:52:34,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:52:34,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:52:34,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 212 [2023-08-30 02:52:34,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:34,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:34,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 212 [2023-08-30 02:52:34,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:34,616 INFO L130 PetriNetUnfolder]: 24/71 cut-off events. [2023-08-30 02:52:34,616 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-08-30 02:52:34,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 71 events. 24/71 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 174 event pairs, 10 based on Foata normal form. 8/77 useless extension candidates. Maximal degree in co-relation 184. Up to 29 conditions per place. [2023-08-30 02:52:34,617 INFO L137 encePairwiseOnDemand]: 207/212 looper letters, 20 selfloop transitions, 5 changer transitions 8/35 dead transitions. [2023-08-30 02:52:34,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 175 flow [2023-08-30 02:52:34,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:52:34,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:52:34,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 575 transitions. [2023-08-30 02:52:34,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4520440251572327 [2023-08-30 02:52:34,628 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 575 transitions. [2023-08-30 02:52:34,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 575 transitions. [2023-08-30 02:52:34,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:34,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 575 transitions. [2023-08-30 02:52:34,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:34,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:34,633 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:34,633 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 67 flow. Second operand 6 states and 575 transitions. [2023-08-30 02:52:34,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 175 flow [2023-08-30 02:52:34,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 162 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-30 02:52:34,635 INFO L231 Difference]: Finished difference. Result has 35 places, 20 transitions, 78 flow [2023-08-30 02:52:34,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=78, PETRI_PLACES=35, PETRI_TRANSITIONS=20} [2023-08-30 02:52:34,636 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2023-08-30 02:52:34,636 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 78 flow [2023-08-30 02:52:34,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:34,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:34,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:52:34,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-30 02:52:34,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:52:34,847 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:34,847 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:34,847 INFO L85 PathProgramCache]: Analyzing trace with hash 397270627, now seen corresponding path program 1 times [2023-08-30 02:52:34,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:52:34,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036187820] [2023-08-30 02:52:34,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:34,848 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:52:34,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:52:34,849 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:52:34,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-30 02:52:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:52:34,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:52:34,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:52:34,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:34,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:52:34,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:52:34,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036187820] [2023-08-30 02:52:34,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036187820] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:34,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:34,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:52:34,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933287791] [2023-08-30 02:52:34,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:34,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:52:34,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:52:34,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:52:34,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:52:34,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 212 [2023-08-30 02:52:34,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 20 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:34,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:34,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 212 [2023-08-30 02:52:34,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:35,074 INFO L130 PetriNetUnfolder]: 24/83 cut-off events. [2023-08-30 02:52:35,074 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2023-08-30 02:52:35,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 83 events. 24/83 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 249 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 220. Up to 47 conditions per place. [2023-08-30 02:52:35,075 INFO L137 encePairwiseOnDemand]: 209/212 looper letters, 34 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2023-08-30 02:52:35,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 221 flow [2023-08-30 02:52:35,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:52:35,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:52:35,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 393 transitions. [2023-08-30 02:52:35,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634433962264151 [2023-08-30 02:52:35,078 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 393 transitions. [2023-08-30 02:52:35,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 393 transitions. [2023-08-30 02:52:35,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:35,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 393 transitions. [2023-08-30 02:52:35,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:35,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:35,083 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:35,083 INFO L175 Difference]: Start difference. First operand has 35 places, 20 transitions, 78 flow. Second operand 4 states and 393 transitions. [2023-08-30 02:52:35,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 221 flow [2023-08-30 02:52:35,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 190 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-30 02:52:35,085 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 75 flow [2023-08-30 02:52:35,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2023-08-30 02:52:35,087 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2023-08-30 02:52:35,087 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 75 flow [2023-08-30 02:52:35,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:35,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:35,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:52:35,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-30 02:52:35,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:52:35,301 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:35,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:35,301 INFO L85 PathProgramCache]: Analyzing trace with hash 235697731, now seen corresponding path program 2 times [2023-08-30 02:52:35,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:52:35,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972163753] [2023-08-30 02:52:35,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:52:35,302 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:52:35,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:52:35,303 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:52:35,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-30 02:52:35,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:52:35,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:52:35,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-30 02:52:35,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:52:35,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:35,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:52:35,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:52:35,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972163753] [2023-08-30 02:52:35,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972163753] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:35,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:35,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:52:35,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437176701] [2023-08-30 02:52:35,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:35,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:52:35,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:52:35,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:52:35,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:52:35,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 212 [2023-08-30 02:52:35,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 75 flow. Second operand has 6 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 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-30 02:52:35,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:35,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 212 [2023-08-30 02:52:35,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:35,720 INFO L130 PetriNetUnfolder]: 22/92 cut-off events. [2023-08-30 02:52:35,720 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2023-08-30 02:52:35,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 92 events. 22/92 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 288 event pairs, 6 based on Foata normal form. 1/92 useless extension candidates. Maximal degree in co-relation 254. Up to 26 conditions per place. [2023-08-30 02:52:35,721 INFO L137 encePairwiseOnDemand]: 206/212 looper letters, 26 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2023-08-30 02:52:35,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 35 transitions, 197 flow [2023-08-30 02:52:35,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:52:35,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:52:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 645 transitions. [2023-08-30 02:52:35,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43463611859838275 [2023-08-30 02:52:35,726 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 645 transitions. [2023-08-30 02:52:35,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 645 transitions. [2023-08-30 02:52:35,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:35,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 645 transitions. [2023-08-30 02:52:35,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:35,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:35,730 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:35,731 INFO L175 Difference]: Start difference. First operand has 33 places, 21 transitions, 75 flow. Second operand 7 states and 645 transitions. [2023-08-30 02:52:35,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 35 transitions, 197 flow [2023-08-30 02:52:35,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 35 transitions, 194 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:52:35,732 INFO L231 Difference]: Finished difference. Result has 40 places, 23 transitions, 98 flow [2023-08-30 02:52:35,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=98, PETRI_PLACES=40, PETRI_TRANSITIONS=23} [2023-08-30 02:52:35,733 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2023-08-30 02:52:35,733 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 23 transitions, 98 flow [2023-08-30 02:52:35,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 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-30 02:52:35,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:35,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:52:35,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-30 02:52:35,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:52:35,935 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:35,935 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:35,935 INFO L85 PathProgramCache]: Analyzing trace with hash 766081145, now seen corresponding path program 3 times [2023-08-30 02:52:35,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:52:35,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276037833] [2023-08-30 02:52:35,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:52:35,936 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:52:35,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:52:35,937 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:52:35,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-30 02:52:36,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 02:52:36,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 02:52:36,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:52:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:52:36,120 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 02:52:36,121 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:52:36,122 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-08-30 02:52:36,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-08-30 02:52:36,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-30 02:52:36,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-08-30 02:52:36,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-30 02:52:36,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-30 02:52:36,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-30 02:52:36,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-08-30 02:52:36,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-08-30 02:52:36,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-30 02:52:36,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-30 02:52:36,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:52:36,342 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2023-08-30 02:52:36,348 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:52:36,348 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:52:36,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:52:36 BasicIcfg [2023-08-30 02:52:36,406 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:52:36,407 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:52:36,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:52:36,407 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:52:36,408 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:52:27" (3/4) ... [2023-08-30 02:52:36,410 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:52:36,410 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:52:36,411 INFO L158 Benchmark]: Toolchain (without parser) took 10462.14ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 63.3MB in the beginning and 55.2MB in the end (delta: 8.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-08-30 02:52:36,411 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 62.9MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:52:36,411 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.20ms. Allocated memory is still 83.9MB. Free memory was 63.1MB in the beginning and 60.0MB in the end (delta: 3.1MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2023-08-30 02:52:36,411 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.05ms. Allocated memory is still 83.9MB. Free memory was 60.0MB in the beginning and 57.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:52:36,412 INFO L158 Benchmark]: Boogie Preprocessor took 43.65ms. Allocated memory is still 83.9MB. Free memory was 57.6MB in the beginning and 55.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:52:36,412 INFO L158 Benchmark]: RCFGBuilder took 659.88ms. Allocated memory is still 83.9MB. Free memory was 55.5MB in the beginning and 48.0MB in the end (delta: 7.6MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2023-08-30 02:52:36,412 INFO L158 Benchmark]: TraceAbstraction took 9175.66ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 47.2MB in the beginning and 56.2MB in the end (delta: -9.0MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2023-08-30 02:52:36,413 INFO L158 Benchmark]: Witness Printer took 3.04ms. Allocated memory is still 100.7MB. Free memory was 56.2MB in the beginning and 55.2MB in the end (delta: 974.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:52:36,414 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.09ms. Allocated memory is still 62.9MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 496.20ms. Allocated memory is still 83.9MB. Free memory was 63.1MB in the beginning and 60.0MB in the end (delta: 3.1MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.05ms. Allocated memory is still 83.9MB. Free memory was 60.0MB in the beginning and 57.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.65ms. Allocated memory is still 83.9MB. Free memory was 57.6MB in the beginning and 55.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 659.88ms. Allocated memory is still 83.9MB. Free memory was 55.5MB in the beginning and 48.0MB in the end (delta: 7.6MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9175.66ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 47.2MB in the beginning and 56.2MB in the end (delta: -9.0MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Witness Printer took 3.04ms. Allocated memory is still 100.7MB. Free memory was 56.2MB in the beginning and 55.2MB in the end (delta: 974.8kB). 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, 107 PlacesBefore, 31 PlacesAfterwards, 102 TransitionsBefore, 25 TransitionsAfterwards, 1384 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 108 TotalNumberOfCompositions, 3593 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1785, independent: 1635, independent conditional: 0, independent unconditional: 1635, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 798, independent: 769, independent conditional: 0, independent unconditional: 769, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1785, independent: 866, independent conditional: 0, independent unconditional: 866, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 798, unknown conditional: 0, unknown unconditional: 798] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 58, Positive conditional cache size: 0, Positive unconditional cache size: 58, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff1_thd0; [L732] 0 _Bool y$r_buff1_thd1; [L733] 0 _Bool y$r_buff1_thd2; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L823] 0 pthread_t t835; [L824] FCALL, FORK 0 pthread_create(&t835, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t835, ((void *)0), P0, ((void *)0))=-1, t835={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t836; [L826] FCALL, FORK 0 pthread_create(&t836, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t836, ((void *)0), P1, ((void *)0))=0, t835={3:0}, t836={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L781] 2 y$w_buff1 = y$w_buff0 [L782] 2 y$w_buff0 = 1 [L783] 2 y$w_buff1_used = y$w_buff0_used [L784] 2 y$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L786] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L787] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L788] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L789] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L792] 2 z = 1 [L795] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L798] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L747] 1 a = 1 [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 y$flush_delayed = weak$$choice2 [L759] 1 y$mem_tmp = y [L760] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L761] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L762] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L763] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L764] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L766] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EBX = y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 2 return 0; [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L830] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L830] RET 0 assume_abort_if_not(main$tmp_guard0) [L832] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835={3:0}, t836={7:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L841] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: 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: 821]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 824]: 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 5 procedures, 125 locations, 10 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: 9.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 129 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 102 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 408 IncrementalHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 7 mSDtfsCounter, 408 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=6, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 209 SizeOfPredicates, 5 NumberOfNonLiveVariables, 541 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 02:52:36,440 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