./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a39929e45dd639f23e29d64b9f64559e1eb8cd260c4b1939e3197ae6524cdca --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:48:31,502 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:48:31,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:48:31,539 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:48:31,540 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:48:31,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:48:31,542 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:48:31,543 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:48:31,545 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:48:31,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:48:31,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:48:31,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:48:31,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:48:31,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:48:31,551 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:48:31,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:48:31,553 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:48:31,558 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:48:31,559 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:48:31,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:48:31,562 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:48:31,577 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:48:31,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:48:31,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:48:31,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:48:31,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:48:31,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:48:31,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:48:31,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:48:31,584 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:48:31,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:48:31,589 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:48:31,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:48:31,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:48:31,591 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:48:31,591 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:48:31,592 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:48:31,592 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:48:31,592 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:48:31,593 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:48:31,594 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:48:31,597 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:48:31,615 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:48:31,616 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:48:31,616 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:48:31,616 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:48:31,617 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:48:31,617 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:48:31,618 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:48:31,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:48:31,618 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:48:31,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:48:31,619 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:48:31,619 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:48:31,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:48:31,619 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:48:31,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:48:31,620 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:48:31,620 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:48:31,620 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:48:31,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:48:31,621 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:48:31,621 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:48:31,621 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:48:31,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:48:31,623 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:48:31,623 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:48:31,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:48:31,624 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:48:31,624 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:48:31,625 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:48:31,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:48:31,625 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:48:31,625 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:48:31,626 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:48:31,626 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:48:31,626 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 -> 6a39929e45dd639f23e29d64b9f64559e1eb8cd260c4b1939e3197ae6524cdca 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:48:31,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:48:31,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:48:31,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:48:31,923 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:48:31,924 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:48:31,925 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-30 02:48:33,139 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:48:33,424 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:48:33,424 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-30 02:48:33,444 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0ebff0b6/f04061a2f0524844ba58e87990794cf7/FLAGa04f7853b [2023-08-30 02:48:33,457 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0ebff0b6/f04061a2f0524844ba58e87990794cf7 [2023-08-30 02:48:33,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:48:33,463 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:48:33,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:48:33,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:48:33,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:48:33,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:48:33" (1/1) ... [2023-08-30 02:48:33,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cf6faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:48:33, skipping insertion in model container [2023-08-30 02:48:33,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:48:33" (1/1) ... [2023-08-30 02:48:33,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:48:33,516 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:48:33,700 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/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] [2023-08-30 02:48:33,910 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:48:33,921 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:48:33,934 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/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] [2023-08-30 02:48:33,988 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:48:34,035 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:48:34,036 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:48:34,042 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:48:34,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:48:34 WrapperNode [2023-08-30 02:48:34,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:48:34,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:48:34,044 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:48:34,044 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:48:34,051 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:48:34" (1/1) ... [2023-08-30 02:48:34,079 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:48:34" (1/1) ... [2023-08-30 02:48:34,107 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 113 [2023-08-30 02:48:34,108 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:48:34,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:48:34,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:48:34,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:48:34,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:48:34" (1/1) ... [2023-08-30 02:48:34,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:48:34" (1/1) ... [2023-08-30 02:48:34,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:48:34" (1/1) ... [2023-08-30 02:48:34,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:48:34" (1/1) ... [2023-08-30 02:48:34,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:48:34" (1/1) ... [2023-08-30 02:48:34,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:48:34" (1/1) ... [2023-08-30 02:48:34,152 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:48:34" (1/1) ... [2023-08-30 02:48:34,157 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:48:34" (1/1) ... [2023-08-30 02:48:34,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:48:34,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:48:34,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:48:34,163 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:48:34,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:48:34" (1/1) ... [2023-08-30 02:48:34,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:48:34,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:48:34,196 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:48:34,221 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:48:34,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:48:34,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:48:34,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:48:34,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:48:34,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:48:34,235 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:48:34,235 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:48:34,236 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:48:34,236 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:48:34,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:48:34,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:48:34,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:48:34,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:48:34,238 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:48:34,372 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:48:34,373 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:48:34,645 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:48:34,812 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:48:34,813 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:48:34,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:48:34 BoogieIcfgContainer [2023-08-30 02:48:34,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:48:34,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:48:34,817 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:48:34,819 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:48:34,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:48:33" (1/3) ... [2023-08-30 02:48:34,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3918158f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:48:34, skipping insertion in model container [2023-08-30 02:48:34,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:48:34" (2/3) ... [2023-08-30 02:48:34,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3918158f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:48:34, skipping insertion in model container [2023-08-30 02:48:34,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:48:34" (3/3) ... [2023-08-30 02:48:34,821 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-30 02:48:34,835 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:48:34,835 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-30 02:48:34,836 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:48:34,873 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:48:34,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 97 transitions, 204 flow [2023-08-30 02:48:34,964 INFO L130 PetriNetUnfolder]: 2/95 cut-off events. [2023-08-30 02:48:34,966 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:48:34,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-30 02:48:34,972 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 97 transitions, 204 flow [2023-08-30 02:48:34,981 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 95 transitions, 196 flow [2023-08-30 02:48:34,985 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:48:34,997 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 95 transitions, 196 flow [2023-08-30 02:48:35,001 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 95 transitions, 196 flow [2023-08-30 02:48:35,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 95 transitions, 196 flow [2023-08-30 02:48:35,025 INFO L130 PetriNetUnfolder]: 2/95 cut-off events. [2023-08-30 02:48:35,025 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:48:35,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-30 02:48:35,027 INFO L119 LiptonReduction]: Number of co-enabled transitions 1232 [2023-08-30 02:48:38,224 INFO L134 LiptonReduction]: Checked pairs total: 3091 [2023-08-30 02:48:38,224 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-08-30 02:48:38,244 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:48:38,252 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;@3b382e7d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:48:38,252 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-30 02:48:38,256 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:48:38,256 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:48:38,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:38,257 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:48:38,258 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:48:38,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:38,263 INFO L85 PathProgramCache]: Analyzing trace with hash 440, now seen corresponding path program 1 times [2023-08-30 02:48:38,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:48:38,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691184117] [2023-08-30 02:48:38,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:38,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:48:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:38,371 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:48:38,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:48:38,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691184117] [2023-08-30 02:48:38,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691184117] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:38,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:38,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:48:38,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130958283] [2023-08-30 02:48:38,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:38,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:48:38,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:48:38,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:48:38,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:48:38,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 191 [2023-08-30 02:48:38,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 56 flow. Second operand has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states 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:48:38,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:38,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 191 [2023-08-30 02:48:38,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:38,546 INFO L130 PetriNetUnfolder]: 264/456 cut-off events. [2023-08-30 02:48:38,547 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 02:48:38,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 922 conditions, 456 events. 264/456 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1855 event pairs, 264 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 912. Up to 451 conditions per place. [2023-08-30 02:48:38,551 INFO L137 encePairwiseOnDemand]: 186/191 looper letters, 18 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2023-08-30 02:48:38,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 82 flow [2023-08-30 02:48:38,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:48:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:48:38,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 195 transitions. [2023-08-30 02:48:38,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5104712041884817 [2023-08-30 02:48:38,562 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 195 transitions. [2023-08-30 02:48:38,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 195 transitions. [2023-08-30 02:48:38,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:38,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 195 transitions. [2023-08-30 02:48:38,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states 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:48:38,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 0 states 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:48:38,571 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 0 states 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:48:38,573 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 56 flow. Second operand 2 states and 195 transitions. [2023-08-30 02:48:38,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 82 flow [2023-08-30 02:48:38,575 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:48:38,576 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 44 flow [2023-08-30 02:48:38,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, 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:48:38,580 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -5 predicate places. [2023-08-30 02:48:38,580 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 44 flow [2023-08-30 02:48:38,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states 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:48:38,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:38,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:48:38,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:48:38,581 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:48:38,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:38,582 INFO L85 PathProgramCache]: Analyzing trace with hash 431968, now seen corresponding path program 1 times [2023-08-30 02:48:38,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:48:38,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942132461] [2023-08-30 02:48:38,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:38,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:48:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:38,812 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:48:38,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:48:38,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942132461] [2023-08-30 02:48:38,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942132461] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:38,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:38,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:48:38,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354292383] [2023-08-30 02:48:38,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:38,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:48:38,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:48:38,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:48:38,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:48:38,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 191 [2023-08-30 02:48:38,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states 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:48:38,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:38,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 191 [2023-08-30 02:48:38,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:38,937 INFO L130 PetriNetUnfolder]: 204/391 cut-off events. [2023-08-30 02:48:38,937 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:48:38,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 391 events. 204/391 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1810 event pairs, 24 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 754. Up to 292 conditions per place. [2023-08-30 02:48:38,940 INFO L137 encePairwiseOnDemand]: 188/191 looper letters, 25 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2023-08-30 02:48:38,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 31 transitions, 126 flow [2023-08-30 02:48:38,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:48:38,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:48:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 285 transitions. [2023-08-30 02:48:38,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4973821989528796 [2023-08-30 02:48:38,943 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 285 transitions. [2023-08-30 02:48:38,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 285 transitions. [2023-08-30 02:48:38,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:38,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 285 transitions. [2023-08-30 02:48:38,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states 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:48:38,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states 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:48:38,947 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states 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:48:38,947 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 44 flow. Second operand 3 states and 285 transitions. [2023-08-30 02:48:38,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 31 transitions, 126 flow [2023-08-30 02:48:38,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:48:38,948 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 44 flow [2023-08-30 02:48:38,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, 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:48:38,949 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2023-08-30 02:48:38,949 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 44 flow [2023-08-30 02:48:38,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states 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:48:38,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:38,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:48:38,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:48:38,951 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:48:38,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:38,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1437641045, now seen corresponding path program 1 times [2023-08-30 02:48:38,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:48:38,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902101924] [2023-08-30 02:48:38,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:38,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:48:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:39,291 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:48:39,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:48:39,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902101924] [2023-08-30 02:48:39,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902101924] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:39,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:39,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:48:39,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612693832] [2023-08-30 02:48:39,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:39,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:48:39,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:48:39,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:48:39,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:48:39,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 191 [2023-08-30 02:48:39,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 0 states have call successors, (0), 0 states 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:48:39,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:39,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 191 [2023-08-30 02:48:39,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:39,412 INFO L130 PetriNetUnfolder]: 142/255 cut-off events. [2023-08-30 02:48:39,412 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2023-08-30 02:48:39,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 255 events. 142/255 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 907 event pairs, 114 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 544. Up to 246 conditions per place. [2023-08-30 02:48:39,414 INFO L137 encePairwiseOnDemand]: 188/191 looper letters, 16 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2023-08-30 02:48:39,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 86 flow [2023-08-30 02:48:39,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:48:39,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:48:39,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 319 transitions. [2023-08-30 02:48:39,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4175392670157068 [2023-08-30 02:48:39,416 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 319 transitions. [2023-08-30 02:48:39,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 319 transitions. [2023-08-30 02:48:39,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:39,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 319 transitions. [2023-08-30 02:48:39,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 0 states 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:48:39,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 0 states have call successors, (0), 0 states 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:48:39,420 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 0 states have call successors, (0), 0 states 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:48:39,420 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 44 flow. Second operand 4 states and 319 transitions. [2023-08-30 02:48:39,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 86 flow [2023-08-30 02:48:39,421 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:48:39,421 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 42 flow [2023-08-30 02:48:39,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=42, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2023-08-30 02:48:39,422 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -5 predicate places. [2023-08-30 02:48:39,422 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 42 flow [2023-08-30 02:48:39,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 0 states have call successors, (0), 0 states 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:48:39,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:39,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:48:39,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:48:39,423 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:48:39,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:39,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1437641110, now seen corresponding path program 1 times [2023-08-30 02:48:39,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:48:39,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49353397] [2023-08-30 02:48:39,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:39,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:48:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:39,627 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:48:39,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:48:39,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49353397] [2023-08-30 02:48:39,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49353397] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:39,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:39,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:48:39,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054228857] [2023-08-30 02:48:39,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:39,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:48:39,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:48:39,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:48:39,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:48:39,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 191 [2023-08-30 02:48:39,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:39,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:39,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 191 [2023-08-30 02:48:39,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:39,739 INFO L130 PetriNetUnfolder]: 193/367 cut-off events. [2023-08-30 02:48:39,740 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 02:48:39,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 367 events. 193/367 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1467 event pairs, 93 based on Foata normal form. 25/392 useless extension candidates. Maximal degree in co-relation 735. Up to 294 conditions per place. [2023-08-30 02:48:39,742 INFO L137 encePairwiseOnDemand]: 186/191 looper letters, 20 selfloop transitions, 3 changer transitions 12/36 dead transitions. [2023-08-30 02:48:39,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 36 transitions, 154 flow [2023-08-30 02:48:39,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:48:39,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:48:39,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 432 transitions. [2023-08-30 02:48:39,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523560209424084 [2023-08-30 02:48:39,744 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 432 transitions. [2023-08-30 02:48:39,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 432 transitions. [2023-08-30 02:48:39,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:39,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 432 transitions. [2023-08-30 02:48:39,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states 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:48:39,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states 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:48:39,748 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states 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:48:39,749 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 42 flow. Second operand 5 states and 432 transitions. [2023-08-30 02:48:39,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 36 transitions, 154 flow [2023-08-30 02:48:39,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:48:39,750 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 66 flow [2023-08-30 02:48:39,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=39, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2023-08-30 02:48:39,751 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-08-30 02:48:39,751 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 66 flow [2023-08-30 02:48:39,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:39,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:39,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:48:39,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:48:39,752 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:48:39,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:39,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1617242558, now seen corresponding path program 1 times [2023-08-30 02:48:39,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:48:39,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362844623] [2023-08-30 02:48:39,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:39,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:48:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:39,876 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:48:39,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:48:39,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362844623] [2023-08-30 02:48:39,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362844623] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:39,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:39,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:48:39,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470379431] [2023-08-30 02:48:39,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:39,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:48:39,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:48:39,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:48:39,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:48:39,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 191 [2023-08-30 02:48:39,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states 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:48:39,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:39,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 191 [2023-08-30 02:48:39,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:39,998 INFO L130 PetriNetUnfolder]: 190/356 cut-off events. [2023-08-30 02:48:39,998 INFO L131 PetriNetUnfolder]: For 162/163 co-relation queries the response was YES. [2023-08-30 02:48:39,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 849 conditions, 356 events. 190/356 cut-off events. For 162/163 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1366 event pairs, 61 based on Foata normal form. 28/383 useless extension candidates. Maximal degree in co-relation 842. Up to 231 conditions per place. [2023-08-30 02:48:40,000 INFO L137 encePairwiseOnDemand]: 187/191 looper letters, 20 selfloop transitions, 2 changer transitions 12/36 dead transitions. [2023-08-30 02:48:40,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 36 transitions, 174 flow [2023-08-30 02:48:40,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:48:40,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:48:40,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 435 transitions. [2023-08-30 02:48:40,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45549738219895286 [2023-08-30 02:48:40,003 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 435 transitions. [2023-08-30 02:48:40,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 435 transitions. [2023-08-30 02:48:40,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:40,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 435 transitions. [2023-08-30 02:48:40,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:40,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states 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:48:40,007 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states 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:48:40,007 INFO L175 Difference]: Start difference. First operand has 31 places, 19 transitions, 66 flow. Second operand 5 states and 435 transitions. [2023-08-30 02:48:40,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 36 transitions, 174 flow [2023-08-30 02:48:40,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 165 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-30 02:48:40,010 INFO L231 Difference]: Finished difference. Result has 34 places, 19 transitions, 71 flow [2023-08-30 02:48:40,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=27, 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=5, PETRI_FLOW=71, PETRI_PLACES=34, PETRI_TRANSITIONS=19} [2023-08-30 02:48:40,011 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2023-08-30 02:48:40,011 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 19 transitions, 71 flow [2023-08-30 02:48:40,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states 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:48:40,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:40,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:48:40,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:48:40,012 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:48:40,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:40,012 INFO L85 PathProgramCache]: Analyzing trace with hash -289479349, now seen corresponding path program 1 times [2023-08-30 02:48:40,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:48:40,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596196162] [2023-08-30 02:48:40,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:40,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:48:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:40,148 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:48:40,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:48:40,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596196162] [2023-08-30 02:48:40,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596196162] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:40,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:40,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:48:40,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193948110] [2023-08-30 02:48:40,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:40,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:48:40,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:48:40,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:48:40,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:48:40,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 191 [2023-08-30 02:48:40,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 19 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 0 states 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:48:40,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:40,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 191 [2023-08-30 02:48:40,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:40,264 INFO L130 PetriNetUnfolder]: 73/170 cut-off events. [2023-08-30 02:48:40,264 INFO L131 PetriNetUnfolder]: For 49/50 co-relation queries the response was YES. [2023-08-30 02:48:40,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 170 events. 73/170 cut-off events. For 49/50 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 611 event pairs, 14 based on Foata normal form. 24/193 useless extension candidates. Maximal degree in co-relation 415. Up to 80 conditions per place. [2023-08-30 02:48:40,266 INFO L137 encePairwiseOnDemand]: 186/191 looper letters, 27 selfloop transitions, 5 changer transitions 9/44 dead transitions. [2023-08-30 02:48:40,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 44 transitions, 214 flow [2023-08-30 02:48:40,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:48:40,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:48:40,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2023-08-30 02:48:40,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722513089005236 [2023-08-30 02:48:40,268 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 451 transitions. [2023-08-30 02:48:40,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 451 transitions. [2023-08-30 02:48:40,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:40,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 451 transitions. [2023-08-30 02:48:40,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:40,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states 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:48:40,273 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states 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:48:40,274 INFO L175 Difference]: Start difference. First operand has 34 places, 19 transitions, 71 flow. Second operand 5 states and 451 transitions. [2023-08-30 02:48:40,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 44 transitions, 214 flow [2023-08-30 02:48:40,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 206 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 02:48:40,276 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 100 flow [2023-08-30 02:48:40,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-08-30 02:48:40,279 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2023-08-30 02:48:40,279 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 100 flow [2023-08-30 02:48:40,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 0 states 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:48:40,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:40,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:48:40,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:48:40,281 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:48:40,282 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:40,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1499186207, now seen corresponding path program 1 times [2023-08-30 02:48:40,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:48:40,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125952421] [2023-08-30 02:48:40,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:40,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:48:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:40,611 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:48:40,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:48:40,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125952421] [2023-08-30 02:48:40,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125952421] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:40,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:40,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:48:40,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997784397] [2023-08-30 02:48:40,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:40,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:48:40,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:48:40,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:48:40,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:48:40,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 191 [2023-08-30 02:48:40,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states 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:48:40,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:40,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 191 [2023-08-30 02:48:40,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:40,720 INFO L130 PetriNetUnfolder]: 47/119 cut-off events. [2023-08-30 02:48:40,721 INFO L131 PetriNetUnfolder]: For 73/74 co-relation queries the response was YES. [2023-08-30 02:48:40,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 119 events. 47/119 cut-off events. For 73/74 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 401 event pairs, 10 based on Foata normal form. 9/127 useless extension candidates. Maximal degree in co-relation 345. Up to 38 conditions per place. [2023-08-30 02:48:40,722 INFO L137 encePairwiseOnDemand]: 186/191 looper letters, 25 selfloop transitions, 8 changer transitions 8/44 dead transitions. [2023-08-30 02:48:40,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 243 flow [2023-08-30 02:48:40,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:48:40,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:48:40,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 615 transitions. [2023-08-30 02:48:40,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4599850411368736 [2023-08-30 02:48:40,724 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 615 transitions. [2023-08-30 02:48:40,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 615 transitions. [2023-08-30 02:48:40,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:40,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 615 transitions. [2023-08-30 02:48:40,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.85714285714286) internal successors, (615), 7 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:40,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 191.0) internal successors, (1528), 8 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states 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:48:40,729 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 191.0) internal successors, (1528), 8 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states 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:48:40,729 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 100 flow. Second operand 7 states and 615 transitions. [2023-08-30 02:48:40,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 243 flow [2023-08-30 02:48:40,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 233 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-30 02:48:40,731 INFO L231 Difference]: Finished difference. Result has 42 places, 24 transitions, 123 flow [2023-08-30 02:48:40,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=123, PETRI_PLACES=42, PETRI_TRANSITIONS=24} [2023-08-30 02:48:40,732 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2023-08-30 02:48:40,732 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 24 transitions, 123 flow [2023-08-30 02:48:40,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states 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:48:40,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:40,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:48:40,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:48:40,733 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:48:40,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:40,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1839758301, now seen corresponding path program 1 times [2023-08-30 02:48:40,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:48:40,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604732134] [2023-08-30 02:48:40,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:40,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:48:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:41,205 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:48:41,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:48:41,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604732134] [2023-08-30 02:48:41,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604732134] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:41,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:41,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:48:41,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002403756] [2023-08-30 02:48:41,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:41,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:48:41,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:48:41,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:48:41,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:48:41,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 191 [2023-08-30 02:48:41,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 24 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 74.83333333333333) internal successors, (449), 6 states have internal predecessors, (449), 0 states have call successors, (0), 0 states 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:48:41,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:41,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 191 [2023-08-30 02:48:41,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:41,456 INFO L130 PetriNetUnfolder]: 109/248 cut-off events. [2023-08-30 02:48:41,457 INFO L131 PetriNetUnfolder]: For 467/467 co-relation queries the response was YES. [2023-08-30 02:48:41,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 248 events. 109/248 cut-off events. For 467/467 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1031 event pairs, 13 based on Foata normal form. 1/249 useless extension candidates. Maximal degree in co-relation 842. Up to 83 conditions per place. [2023-08-30 02:48:41,458 INFO L137 encePairwiseOnDemand]: 180/191 looper letters, 18 selfloop transitions, 10 changer transitions 49/77 dead transitions. [2023-08-30 02:48:41,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 77 transitions, 573 flow [2023-08-30 02:48:41,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:48:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:48:41,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 633 transitions. [2023-08-30 02:48:41,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4142670157068063 [2023-08-30 02:48:41,461 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 633 transitions. [2023-08-30 02:48:41,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 633 transitions. [2023-08-30 02:48:41,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:41,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 633 transitions. [2023-08-30 02:48:41,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 79.125) internal successors, (633), 8 states have internal predecessors, (633), 0 states have call successors, (0), 0 states 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:48:41,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 191.0) internal successors, (1719), 9 states have internal predecessors, (1719), 0 states have call successors, (0), 0 states 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:48:41,466 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 191.0) internal successors, (1719), 9 states have internal predecessors, (1719), 0 states have call successors, (0), 0 states 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:48:41,466 INFO L175 Difference]: Start difference. First operand has 42 places, 24 transitions, 123 flow. Second operand 8 states and 633 transitions. [2023-08-30 02:48:41,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 77 transitions, 573 flow [2023-08-30 02:48:41,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 77 transitions, 482 flow, removed 21 selfloop flow, removed 6 redundant places. [2023-08-30 02:48:41,470 INFO L231 Difference]: Finished difference. Result has 47 places, 25 transitions, 144 flow [2023-08-30 02:48:41,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=144, PETRI_PLACES=47, PETRI_TRANSITIONS=25} [2023-08-30 02:48:41,470 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 16 predicate places. [2023-08-30 02:48:41,471 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 25 transitions, 144 flow [2023-08-30 02:48:41,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.83333333333333) internal successors, (449), 6 states have internal predecessors, (449), 0 states have call successors, (0), 0 states 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:48:41,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:41,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:48:41,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:48:41,472 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:48:41,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:41,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1553630845, now seen corresponding path program 2 times [2023-08-30 02:48:41,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:48:41,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037968206] [2023-08-30 02:48:41,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:41,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:48:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:48:41,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:48:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:48:41,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:48:41,557 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:48:41,558 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-08-30 02:48:41,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-08-30 02:48:41,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-30 02:48:41,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-08-30 02:48:41,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-30 02:48:41,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-30 02:48:41,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-30 02:48:41,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-08-30 02:48:41,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-08-30 02:48:41,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-30 02:48:41,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:48:41,563 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:48:41,567 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:48:41,567 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:48:41,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:48:41 BasicIcfg [2023-08-30 02:48:41,607 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:48:41,607 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:48:41,607 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:48:41,608 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:48:41,608 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:48:34" (3/4) ... [2023-08-30 02:48:41,610 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:48:41,610 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:48:41,611 INFO L158 Benchmark]: Toolchain (without parser) took 8147.33ms. Allocated memory was 79.7MB in the beginning and 148.9MB in the end (delta: 69.2MB). Free memory was 56.2MB in the beginning and 84.8MB in the end (delta: -28.6MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2023-08-30 02:48:41,611 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory is still 34.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:48:41,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 579.53ms. Allocated memory is still 79.7MB. Free memory was 55.9MB in the beginning and 54.8MB in the end (delta: 1.2MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2023-08-30 02:48:41,612 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.96ms. Allocated memory is still 79.7MB. Free memory was 54.8MB in the beginning and 52.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:48:41,612 INFO L158 Benchmark]: Boogie Preprocessor took 51.31ms. Allocated memory is still 79.7MB. Free memory was 52.6MB in the beginning and 50.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:48:41,612 INFO L158 Benchmark]: RCFGBuilder took 652.24ms. Allocated memory is still 79.7MB. Free memory was 50.5MB in the beginning and 43.9MB in the end (delta: 6.6MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2023-08-30 02:48:41,613 INFO L158 Benchmark]: TraceAbstraction took 6790.43ms. Allocated memory was 79.7MB in the beginning and 148.9MB in the end (delta: 69.2MB). Free memory was 43.0MB in the beginning and 84.8MB in the end (delta: -41.7MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2023-08-30 02:48:41,613 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 148.9MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:48:41,615 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory is still 34.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 579.53ms. Allocated memory is still 79.7MB. Free memory was 55.9MB in the beginning and 54.8MB in the end (delta: 1.2MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.96ms. Allocated memory is still 79.7MB. Free memory was 54.8MB in the beginning and 52.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.31ms. Allocated memory is still 79.7MB. Free memory was 52.6MB in the beginning and 50.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 652.24ms. Allocated memory is still 79.7MB. Free memory was 50.5MB in the beginning and 43.9MB in the end (delta: 6.6MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6790.43ms. Allocated memory was 79.7MB in the beginning and 148.9MB in the end (delta: 69.2MB). Free memory was 43.0MB in the beginning and 84.8MB in the end (delta: -41.7MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 148.9MB. Free memory is still 84.8MB. 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.2s, 100 PlacesBefore, 31 PlacesAfterwards, 95 TransitionsBefore, 25 TransitionsAfterwards, 1232 CoEnabledTransitionPairs, 6 FixpointIterations, 44 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 94 TotalNumberOfCompositions, 3091 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1521, independent: 1393, independent conditional: 0, independent unconditional: 1393, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 669, independent: 643, independent conditional: 0, independent unconditional: 643, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1521, independent: 750, independent conditional: 0, independent unconditional: 750, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 669, unknown conditional: 0, unknown unconditional: 669] , 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t585; [L811] FCALL, FORK 0 pthread_create(&t585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t585, ((void *)0), P0, ((void *)0))=-1, t585={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] [L812] 0 pthread_t t586; [L813] FCALL, FORK 0 pthread_create(&t586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t586, ((void *)0), P1, ((void *)0))=0, t585={5:0}, t586={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] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 1 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L766] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EBX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 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) [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] 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 [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 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) [L820] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L821] 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 [L822] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L823] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t585={5:0}, t586={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L826] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L828] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 813]: 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: 811]: 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, 116 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: 6.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 257 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 180 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 616 IncrementalHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 41 mSDtfsCounter, 616 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=8, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 363 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 02:48:41,649 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/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a39929e45dd639f23e29d64b9f64559e1eb8cd260c4b1939e3197ae6524cdca --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:48:43,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:48:43,427 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:48:43,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:48:43,457 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:48:43,458 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:48:43,460 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:48:43,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:48:43,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:48:43,467 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:48:43,469 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:48:43,471 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:48:43,472 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:48:43,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:48:43,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:48:43,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:48:43,479 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:48:43,480 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:48:43,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:48:43,486 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:48:43,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:48:43,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:48:43,501 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:48:43,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:48:43,508 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:48:43,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:48:43,512 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:48:43,513 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:48:43,514 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:48:43,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:48:43,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:48:43,516 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:48:43,517 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:48:43,518 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:48:43,519 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:48:43,520 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:48:43,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:48:43,521 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:48:43,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:48:43,522 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:48:43,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:48:43,524 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:48:43,560 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:48:43,560 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:48:43,561 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:48:43,561 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:48:43,562 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:48:43,562 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:48:43,563 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:48:43,563 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:48:43,563 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:48:43,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:48:43,564 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:48:43,564 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:48:43,565 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:48:43,565 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:48:43,565 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:48:43,565 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:48:43,565 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:48:43,566 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:48:43,566 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:48:43,566 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:48:43,566 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 02:48:43,566 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 02:48:43,567 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:48:43,567 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:48:43,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:48:43,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:48:43,567 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:48:43,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:48:43,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:48:43,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:48:43,568 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 02:48:43,568 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 02:48:43,569 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:48:43,569 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:48:43,569 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:48:43,569 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 02:48:43,569 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:48:43,570 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 -> 6a39929e45dd639f23e29d64b9f64559e1eb8cd260c4b1939e3197ae6524cdca 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:48:43,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:48:43,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:48:43,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:48:43,886 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:48:43,886 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:48:43,887 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-30 02:48:44,942 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:48:45,226 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:48:45,227 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-30 02:48:45,237 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4609b7e08/a2de4dc751734d6fa97f9f8b370745c4/FLAGe8cbe9ed4 [2023-08-30 02:48:45,251 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4609b7e08/a2de4dc751734d6fa97f9f8b370745c4 [2023-08-30 02:48:45,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:48:45,259 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:48:45,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:48:45,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:48:45,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:48:45,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:48:45" (1/1) ... [2023-08-30 02:48:45,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35028649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:48:45, skipping insertion in model container [2023-08-30 02:48:45,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:48:45" (1/1) ... [2023-08-30 02:48:45,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:48:45,311 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:48:45,433 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/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] [2023-08-30 02:48:45,612 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:48:45,631 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:48:45,645 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/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] [2023-08-30 02:48:45,710 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:48:45,782 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:48:45,782 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:48:45,788 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:48:45,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:48:45 WrapperNode [2023-08-30 02:48:45,791 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:48:45,792 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:48:45,792 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:48:45,793 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:48:45,798 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:48:45" (1/1) ... [2023-08-30 02:48:45,825 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:48:45" (1/1) ... [2023-08-30 02:48:45,860 INFO L138 Inliner]: procedures = 178, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2023-08-30 02:48:45,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:48:45,863 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:48:45,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:48:45,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:48:45,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:48:45" (1/1) ... [2023-08-30 02:48:45,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:48:45" (1/1) ... [2023-08-30 02:48:45,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:48:45" (1/1) ... [2023-08-30 02:48:45,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:48:45" (1/1) ... [2023-08-30 02:48:45,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:48:45" (1/1) ... [2023-08-30 02:48:45,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:48:45" (1/1) ... [2023-08-30 02:48:45,910 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:48:45" (1/1) ... [2023-08-30 02:48:45,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:48:45" (1/1) ... [2023-08-30 02:48:45,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:48:45,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:48:45,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:48:45,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:48:45,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:48:45" (1/1) ... [2023-08-30 02:48:45,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:48:45,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:48:45,957 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:48:45,987 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:48:46,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:48:46,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:48:46,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:48:46,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:48:46,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 02:48:46,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 02:48:46,003 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:48:46,003 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:48:46,003 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:48:46,003 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:48:46,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:48:46,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:48:46,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:48:46,005 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:48:46,155 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:48:46,170 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:48:46,511 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:48:46,628 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:48:46,628 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:48:46,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:48:46 BoogieIcfgContainer [2023-08-30 02:48:46,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:48:46,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:48:46,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:48:46,636 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:48:46,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:48:45" (1/3) ... [2023-08-30 02:48:46,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84caf62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:48:46, skipping insertion in model container [2023-08-30 02:48:46,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:48:45" (2/3) ... [2023-08-30 02:48:46,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84caf62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:48:46, skipping insertion in model container [2023-08-30 02:48:46,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:48:46" (3/3) ... [2023-08-30 02:48:46,638 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-30 02:48:46,653 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:48:46,653 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-30 02:48:46,654 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:48:46,727 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:48:46,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 98 transitions, 206 flow [2023-08-30 02:48:46,819 INFO L130 PetriNetUnfolder]: 2/96 cut-off events. [2023-08-30 02:48:46,820 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:48:46,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-30 02:48:46,825 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 98 transitions, 206 flow [2023-08-30 02:48:46,829 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 96 transitions, 198 flow [2023-08-30 02:48:46,833 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:48:46,843 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 96 transitions, 198 flow [2023-08-30 02:48:46,845 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 96 transitions, 198 flow [2023-08-30 02:48:46,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 96 transitions, 198 flow [2023-08-30 02:48:46,865 INFO L130 PetriNetUnfolder]: 2/96 cut-off events. [2023-08-30 02:48:46,865 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:48:46,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-30 02:48:46,867 INFO L119 LiptonReduction]: Number of co-enabled transitions 1232 [2023-08-30 02:48:51,692 INFO L134 LiptonReduction]: Checked pairs total: 3090 [2023-08-30 02:48:51,693 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-08-30 02:48:51,704 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:48:51,709 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;@469b8612, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:48:51,709 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-30 02:48:51,710 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:48:51,710 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:48:51,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:51,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:48:51,711 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:48:51,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:51,715 INFO L85 PathProgramCache]: Analyzing trace with hash 444, now seen corresponding path program 1 times [2023-08-30 02:48:51,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:48:51,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37804051] [2023-08-30 02:48:51,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:51,725 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:48:51,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:48:51,731 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:48:51,732 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:48:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:51,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 02:48:51,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:48:51,798 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:48:51,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:48:51,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:48:51,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37804051] [2023-08-30 02:48:51,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37804051] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:51,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:51,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:48:51,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536666773] [2023-08-30 02:48:51,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:51,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:48:51,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:48:51,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:48:51,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:48:51,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 195 [2023-08-30 02:48:51,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 56 flow. Second operand has 2 states, 2 states have (on average 87.5) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states 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:48:51,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:51,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 195 [2023-08-30 02:48:51,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:52,033 INFO L130 PetriNetUnfolder]: 264/455 cut-off events. [2023-08-30 02:48:52,033 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 02:48:52,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 921 conditions, 455 events. 264/455 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1854 event pairs, 264 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 911. Up to 451 conditions per place. [2023-08-30 02:48:52,039 INFO L137 encePairwiseOnDemand]: 190/195 looper letters, 18 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2023-08-30 02:48:52,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 82 flow [2023-08-30 02:48:52,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:48:52,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:48:52,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 197 transitions. [2023-08-30 02:48:52,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051282051282051 [2023-08-30 02:48:52,064 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 197 transitions. [2023-08-30 02:48:52,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 197 transitions. [2023-08-30 02:48:52,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:52,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 197 transitions. [2023-08-30 02:48:52,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 98.5) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 0 states 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:48:52,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states 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:48:52,079 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states 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:48:52,081 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 56 flow. Second operand 2 states and 197 transitions. [2023-08-30 02:48:52,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 82 flow [2023-08-30 02:48:52,084 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:48:52,086 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 44 flow [2023-08-30 02:48:52,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, 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:48:52,094 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -5 predicate places. [2023-08-30 02:48:52,095 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 44 flow [2023-08-30 02:48:52,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 87.5) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states 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:48:52,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:52,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:48:52,114 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:48:52,314 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:48:52,315 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:48:52,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:52,316 INFO L85 PathProgramCache]: Analyzing trace with hash 437799, now seen corresponding path program 1 times [2023-08-30 02:48:52,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:48:52,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344156182] [2023-08-30 02:48:52,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:52,317 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:48:52,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:48:52,318 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:48:52,320 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:48:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:52,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:48:52,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:48:52,416 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:48:52,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:48:52,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:48:52,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344156182] [2023-08-30 02:48:52,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344156182] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:52,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:52,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:48:52,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138991751] [2023-08-30 02:48:52,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:52,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:48:52,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:48:52,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:48:52,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:48:52,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 195 [2023-08-30 02:48:52,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:52,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:52,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 195 [2023-08-30 02:48:52,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:52,574 INFO L130 PetriNetUnfolder]: 204/391 cut-off events. [2023-08-30 02:48:52,575 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:48:52,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 391 events. 204/391 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1829 event pairs, 24 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 754. Up to 292 conditions per place. [2023-08-30 02:48:52,581 INFO L137 encePairwiseOnDemand]: 192/195 looper letters, 25 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2023-08-30 02:48:52,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 31 transitions, 126 flow [2023-08-30 02:48:52,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:48:52,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:48:52,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2023-08-30 02:48:52,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49230769230769234 [2023-08-30 02:48:52,587 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 288 transitions. [2023-08-30 02:48:52,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 288 transitions. [2023-08-30 02:48:52,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:52,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 288 transitions. [2023-08-30 02:48:52,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states 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:48:52,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states 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:48:52,592 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states 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:48:52,592 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 44 flow. Second operand 3 states and 288 transitions. [2023-08-30 02:48:52,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 31 transitions, 126 flow [2023-08-30 02:48:52,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:48:52,594 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 44 flow [2023-08-30 02:48:52,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, 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:48:52,595 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2023-08-30 02:48:52,595 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 44 flow [2023-08-30 02:48:52,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:52,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:52,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:48:52,612 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:48:52,805 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:48:52,805 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:48:52,806 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:52,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1774264958, now seen corresponding path program 1 times [2023-08-30 02:48:52,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:48:52,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645289879] [2023-08-30 02:48:52,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:52,807 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:48:52,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:48:52,808 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:48:52,812 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:48:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:52,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:48:52,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:48:52,929 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:48:52,930 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:48:52,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:48:52,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645289879] [2023-08-30 02:48:52,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645289879] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:52,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:52,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:48:52,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349379957] [2023-08-30 02:48:52,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:52,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:48:52,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:48:52,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:48:52,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:48:52,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 195 [2023-08-30 02:48:52,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:52,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:52,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 195 [2023-08-30 02:48:52,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:53,063 INFO L130 PetriNetUnfolder]: 76/169 cut-off events. [2023-08-30 02:48:53,063 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-30 02:48:53,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 169 events. 76/169 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 619 event pairs, 15 based on Foata normal form. 20/180 useless extension candidates. Maximal degree in co-relation 362. Up to 94 conditions per place. [2023-08-30 02:48:53,065 INFO L137 encePairwiseOnDemand]: 190/195 looper letters, 22 selfloop transitions, 3 changer transitions 15/42 dead transitions. [2023-08-30 02:48:53,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 42 transitions, 180 flow [2023-08-30 02:48:53,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:48:53,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:48:53,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 457 transitions. [2023-08-30 02:48:53,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4687179487179487 [2023-08-30 02:48:53,067 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 457 transitions. [2023-08-30 02:48:53,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 457 transitions. [2023-08-30 02:48:53,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:53,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 457 transitions. [2023-08-30 02:48:53,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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:48:53,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states 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:48:53,072 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states 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:48:53,072 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 44 flow. Second operand 5 states and 457 transitions. [2023-08-30 02:48:53,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 42 transitions, 180 flow [2023-08-30 02:48:53,073 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:48:53,074 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 67 flow [2023-08-30 02:48:53,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, 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:48:53,075 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-08-30 02:48:53,075 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 67 flow [2023-08-30 02:48:53,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:53,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:53,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:48:53,091 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:48:53,285 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:48:53,285 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:48:53,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:53,286 INFO L85 PathProgramCache]: Analyzing trace with hash -696183729, now seen corresponding path program 1 times [2023-08-30 02:48:53,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:48:53,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647617469] [2023-08-30 02:48:53,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:53,287 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:48:53,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:48:53,289 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:48:53,291 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:48:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:53,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:48:53,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:48:53,432 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:48:53,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:48:53,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:48:53,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647617469] [2023-08-30 02:48:53,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647617469] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:53,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:53,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:48:53,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456339681] [2023-08-30 02:48:53,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:53,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:48:53,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:48:53,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:48:53,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:48:53,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 195 [2023-08-30 02:48:53,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 0 states 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:48:53,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:53,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 195 [2023-08-30 02:48:53,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:53,584 INFO L130 PetriNetUnfolder]: 24/70 cut-off events. [2023-08-30 02:48:53,584 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-08-30 02:48:53,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 70 events. 24/70 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 176 event pairs, 10 based on Foata normal form. 8/76 useless extension candidates. Maximal degree in co-relation 183. Up to 29 conditions per place. [2023-08-30 02:48:53,584 INFO L137 encePairwiseOnDemand]: 190/195 looper letters, 20 selfloop transitions, 5 changer transitions 8/35 dead transitions. [2023-08-30 02:48:53,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 175 flow [2023-08-30 02:48:53,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:48:53,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:48:53,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 533 transitions. [2023-08-30 02:48:53,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2023-08-30 02:48:53,587 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 533 transitions. [2023-08-30 02:48:53,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 533 transitions. [2023-08-30 02:48:53,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:53,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 533 transitions. [2023-08-30 02:48:53,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 88.83333333333333) internal successors, (533), 6 states have internal predecessors, (533), 0 states have call successors, (0), 0 states 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:48:53,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:53,591 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:53,591 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 67 flow. Second operand 6 states and 533 transitions. [2023-08-30 02:48:53,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 175 flow [2023-08-30 02:48:53,592 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:48:53,594 INFO L231 Difference]: Finished difference. Result has 35 places, 20 transitions, 78 flow [2023-08-30 02:48:53,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, 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:48:53,595 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2023-08-30 02:48:53,595 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 78 flow [2023-08-30 02:48:53,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 0 states 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:48:53,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:53,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:48:53,605 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:48:53,796 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:48:53,797 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:48:53,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:53,797 INFO L85 PathProgramCache]: Analyzing trace with hash 434021565, now seen corresponding path program 1 times [2023-08-30 02:48:53,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:48:53,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231825483] [2023-08-30 02:48:53,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:53,798 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:48:53,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:48:53,799 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:48:53,802 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:48:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:53,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-30 02:48:53,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:48:54,101 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:48:54,102 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:48:54,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:48:54,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231825483] [2023-08-30 02:48:54,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231825483] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:54,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:54,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:48:54,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667461310] [2023-08-30 02:48:54,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:54,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:48:54,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:48:54,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:48:54,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:48:54,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 195 [2023-08-30 02:48:54,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 20 transitions, 78 flow. Second operand has 7 states, 7 states have (on average 80.14285714285714) internal successors, (561), 7 states have internal predecessors, (561), 0 states have call successors, (0), 0 states 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:48:54,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:54,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 195 [2023-08-30 02:48:54,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:54,304 INFO L130 PetriNetUnfolder]: 19/71 cut-off events. [2023-08-30 02:48:54,305 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2023-08-30 02:48:54,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 71 events. 19/71 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 180 event pairs, 0 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 192. Up to 25 conditions per place. [2023-08-30 02:48:54,305 INFO L137 encePairwiseOnDemand]: 188/195 looper letters, 32 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2023-08-30 02:48:54,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 242 flow [2023-08-30 02:48:54,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:48:54,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:48:54,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 660 transitions. [2023-08-30 02:48:54,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2023-08-30 02:48:54,308 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 660 transitions. [2023-08-30 02:48:54,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 660 transitions. [2023-08-30 02:48:54,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:54,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 660 transitions. [2023-08-30 02:48:54,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 82.5) internal successors, (660), 8 states have internal predecessors, (660), 0 states have call successors, (0), 0 states 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:48:54,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 195.0) internal successors, (1755), 9 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states 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:48:54,316 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 195.0) internal successors, (1755), 9 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states 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:48:54,317 INFO L175 Difference]: Start difference. First operand has 35 places, 20 transitions, 78 flow. Second operand 8 states and 660 transitions. [2023-08-30 02:48:54,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 242 flow [2023-08-30 02:48:54,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 210 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-30 02:48:54,330 INFO L231 Difference]: Finished difference. Result has 38 places, 23 transitions, 94 flow [2023-08-30 02:48:54,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=94, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2023-08-30 02:48:54,333 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2023-08-30 02:48:54,333 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 94 flow [2023-08-30 02:48:54,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 80.14285714285714) internal successors, (561), 7 states have internal predecessors, (561), 0 states have call successors, (0), 0 states 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:48:54,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:54,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:48:54,348 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:48:54,545 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:48:54,546 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:48:54,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:54,546 INFO L85 PathProgramCache]: Analyzing trace with hash 2050870487, now seen corresponding path program 2 times [2023-08-30 02:48:54,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:48:54,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [537581573] [2023-08-30 02:48:54,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:48:54,547 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:48:54,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:48:54,548 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:48:54,549 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:48:54,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:48:54,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:48:54,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:48:54,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:48:54,659 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:48:54,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:48:54,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:48:54,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [537581573] [2023-08-30 02:48:54,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [537581573] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:54,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:54,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:48:54,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113135716] [2023-08-30 02:48:54,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:54,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:48:54,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:48:54,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:48:54,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:48:54,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 195 [2023-08-30 02:48:54,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:54,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:54,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 195 [2023-08-30 02:48:54,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:54,760 INFO L130 PetriNetUnfolder]: 31/113 cut-off events. [2023-08-30 02:48:54,760 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2023-08-30 02:48:54,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 113 events. 31/113 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 387 event pairs, 11 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 336. Up to 58 conditions per place. [2023-08-30 02:48:54,761 INFO L137 encePairwiseOnDemand]: 191/195 looper letters, 35 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2023-08-30 02:48:54,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 244 flow [2023-08-30 02:48:54,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:48:54,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:48:54,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 354 transitions. [2023-08-30 02:48:54,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45384615384615384 [2023-08-30 02:48:54,763 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 354 transitions. [2023-08-30 02:48:54,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 354 transitions. [2023-08-30 02:48:54,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:54,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 354 transitions. [2023-08-30 02:48:54,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states 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:48:54,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states 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:48:54,766 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states 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:48:54,766 INFO L175 Difference]: Start difference. First operand has 38 places, 23 transitions, 94 flow. Second operand 4 states and 354 transitions. [2023-08-30 02:48:54,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 244 flow [2023-08-30 02:48:54,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 40 transitions, 236 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:48:54,768 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 122 flow [2023-08-30 02:48:54,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2023-08-30 02:48:54,768 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2023-08-30 02:48:54,768 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 122 flow [2023-08-30 02:48:54,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:54,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:54,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:48:54,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-08-30 02:48:54,981 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:48:54,981 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:48:54,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:54,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1567675648, now seen corresponding path program 1 times [2023-08-30 02:48:54,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:48:54,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711424893] [2023-08-30 02:48:54,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:54,982 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:48:54,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:48:54,983 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:48:54,986 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:48:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:55,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-30 02:48:55,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:48:55,310 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:48:55,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:48:55,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:48:55,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711424893] [2023-08-30 02:48:55,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711424893] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:55,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:55,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:48:55,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944107764] [2023-08-30 02:48:55,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:55,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:48:55,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:48:55,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:48:55,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:48:55,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 195 [2023-08-30 02:48:55,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 77.75) internal successors, (311), 4 states have internal predecessors, (311), 0 states have call successors, (0), 0 states 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:48:55,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:55,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 195 [2023-08-30 02:48:55,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:55,502 INFO L130 PetriNetUnfolder]: 26/99 cut-off events. [2023-08-30 02:48:55,502 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2023-08-30 02:48:55,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 99 events. 26/99 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 338 event pairs, 8 based on Foata normal form. 4/103 useless extension candidates. Maximal degree in co-relation 308. Up to 87 conditions per place. [2023-08-30 02:48:55,503 INFO L137 encePairwiseOnDemand]: 192/195 looper letters, 16 selfloop transitions, 2 changer transitions 8/28 dead transitions. [2023-08-30 02:48:55,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 28 transitions, 184 flow [2023-08-30 02:48:55,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:48:55,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:48:55,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 315 transitions. [2023-08-30 02:48:55,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40384615384615385 [2023-08-30 02:48:55,505 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 315 transitions. [2023-08-30 02:48:55,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 315 transitions. [2023-08-30 02:48:55,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:55,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 315 transitions. [2023-08-30 02:48:55,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:55,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states 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:48:55,508 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states 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:48:55,508 INFO L175 Difference]: Start difference. First operand has 40 places, 26 transitions, 122 flow. Second operand 4 states and 315 transitions. [2023-08-30 02:48:55,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 28 transitions, 184 flow [2023-08-30 02:48:55,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 28 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:48:55,511 INFO L231 Difference]: Finished difference. Result has 41 places, 19 transitions, 82 flow [2023-08-30 02:48:55,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=41, PETRI_TRANSITIONS=19} [2023-08-30 02:48:55,511 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2023-08-30 02:48:55,511 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 19 transitions, 82 flow [2023-08-30 02:48:55,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.75) internal successors, (311), 4 states have internal predecessors, (311), 0 states have call successors, (0), 0 states 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:48:55,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:55,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:48:55,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-30 02:48:55,723 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:48:55,723 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:48:55,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:55,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1510280975, now seen corresponding path program 3 times [2023-08-30 02:48:55,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:48:55,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388096005] [2023-08-30 02:48:55,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:48:55,724 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:48:55,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:48:55,725 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:48:55,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-30 02:48:55,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 02:48:55,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 02:48:55,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:48:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:48:55,897 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 02:48:55,897 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:48:55,898 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-08-30 02:48:55,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-08-30 02:48:55,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-30 02:48:55,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-08-30 02:48:55,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-30 02:48:55,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-30 02:48:55,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-30 02:48:55,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-08-30 02:48:55,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-08-30 02:48:55,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-30 02:48:55,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-30 02:48:56,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:48:56,107 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-08-30 02:48:56,111 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:48:56,111 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:48:56,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:48:56 BasicIcfg [2023-08-30 02:48:56,153 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:48:56,153 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:48:56,153 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:48:56,153 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:48:56,154 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:48:46" (3/4) ... [2023-08-30 02:48:56,158 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:48:56,158 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:48:56,158 INFO L158 Benchmark]: Toolchain (without parser) took 10899.15ms. Allocated memory was 83.9MB in the beginning and 136.3MB in the end (delta: 52.4MB). Free memory was 60.6MB in the beginning and 59.2MB in the end (delta: 1.5MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. [2023-08-30 02:48:56,159 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory was 34.7MB in the beginning and 34.6MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:48:56,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 531.28ms. Allocated memory is still 83.9MB. Free memory was 60.6MB in the beginning and 57.3MB in the end (delta: 3.3MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2023-08-30 02:48:56,159 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.32ms. Allocated memory is still 83.9MB. Free memory was 57.3MB in the beginning and 54.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:48:56,159 INFO L158 Benchmark]: Boogie Preprocessor took 57.71ms. Allocated memory is still 83.9MB. Free memory was 54.9MB in the beginning and 52.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:48:56,160 INFO L158 Benchmark]: RCFGBuilder took 709.57ms. Allocated memory is still 83.9MB. Free memory was 52.8MB in the beginning and 39.9MB in the end (delta: 12.9MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2023-08-30 02:48:56,160 INFO L158 Benchmark]: TraceAbstraction took 9519.89ms. Allocated memory was 83.9MB in the beginning and 136.3MB in the end (delta: 52.4MB). Free memory was 39.5MB in the beginning and 60.2MB in the end (delta: -20.7MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2023-08-30 02:48:56,163 INFO L158 Benchmark]: Witness Printer took 4.59ms. Allocated memory is still 136.3MB. Free memory was 60.2MB in the beginning and 59.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:48:56,165 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory was 34.7MB in the beginning and 34.6MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 531.28ms. Allocated memory is still 83.9MB. Free memory was 60.6MB in the beginning and 57.3MB in the end (delta: 3.3MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.32ms. Allocated memory is still 83.9MB. Free memory was 57.3MB in the beginning and 54.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.71ms. Allocated memory is still 83.9MB. Free memory was 54.9MB in the beginning and 52.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 709.57ms. Allocated memory is still 83.9MB. Free memory was 52.8MB in the beginning and 39.9MB in the end (delta: 12.9MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9519.89ms. Allocated memory was 83.9MB in the beginning and 136.3MB in the end (delta: 52.4MB). Free memory was 39.5MB in the beginning and 60.2MB in the end (delta: -20.7MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * Witness Printer took 4.59ms. Allocated memory is still 136.3MB. Free memory was 60.2MB in the beginning and 59.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 101 PlacesBefore, 31 PlacesAfterwards, 96 TransitionsBefore, 25 TransitionsAfterwards, 1232 CoEnabledTransitionPairs, 6 FixpointIterations, 49 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, 3090 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1318, independent: 1190, independent conditional: 0, independent unconditional: 1190, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 619, independent: 595, independent conditional: 0, independent unconditional: 595, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1318, independent: 595, independent conditional: 0, independent unconditional: 595, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 619, unknown conditional: 0, unknown unconditional: 619] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t585; [L811] FCALL, FORK 0 pthread_create(&t585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t585, ((void *)0), P0, ((void *)0))=0, t585={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] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 1 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L812] 0 pthread_t t586; [L813] FCALL, FORK 0 pthread_create(&t586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t586, ((void *)0), P1, ((void *)0))=1, t585={3:0}, t586={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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L766] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EBX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L788] 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) [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] 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 [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] 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 [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 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) [L820] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L821] 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 [L822] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L823] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t585={3:0}, t586={7:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L826] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L828] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 811]: 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: 813]: 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, 117 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.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 232 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 151 mSDsluCounter, 117 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 598 IncrementalHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 42 mSDtfsCounter, 598 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=6, InterpolantAutomatonStates: 32, 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.6s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 68 ConstructedInterpolants, 13 QuantifiedInterpolants, 554 SizeOfPredicates, 10 NumberOfNonLiveVariables, 655 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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:48:56,186 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