./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe017_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/safe017_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 b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 03:12:50,544 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 03:12:50,546 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 03:12:50,573 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 03:12:50,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 03:12:50,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 03:12:50,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 03:12:50,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 03:12:50,589 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 03:12:50,595 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 03:12:50,596 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 03:12:50,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 03:12:50,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 03:12:50,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 03:12:50,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 03:12:50,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 03:12:50,611 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 03:12:50,612 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 03:12:50,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 03:12:50,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 03:12:50,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 03:12:50,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 03:12:50,624 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 03:12:50,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 03:12:50,630 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 03:12:50,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 03:12:50,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 03:12:50,634 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 03:12:50,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 03:12:50,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 03:12:50,636 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 03:12:50,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 03:12:50,639 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 03:12:50,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 03:12:50,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 03:12:50,641 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 03:12:50,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 03:12:50,642 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 03:12:50,642 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 03:12:50,643 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 03:12:50,644 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 03:12:50,646 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 03:12:50,686 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 03:12:50,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 03:12:50,688 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 03:12:50,688 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 03:12:50,689 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 03:12:50,689 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 03:12:50,690 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 03:12:50,690 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 03:12:50,690 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 03:12:50,691 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 03:12:50,691 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 03:12:50,692 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 03:12:50,692 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 03:12:50,692 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 03:12:50,692 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 03:12:50,692 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 03:12:50,693 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 03:12:50,693 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 03:12:50,693 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 03:12:50,693 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 03:12:50,693 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 03:12:50,694 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 03:12:50,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 03:12:50,694 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 03:12:50,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 03:12:50,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:12:50,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 03:12:50,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 03:12:50,695 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 03:12:50,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 03:12:50,695 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 03:12:50,696 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 03:12:50,696 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 03:12:50,696 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 03:12:50,696 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 -> b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 03:12:51,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 03:12:51,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 03:12:51,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 03:12:51,068 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 03:12:51,068 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 03:12:51,070 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-30 03:12:52,258 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 03:12:52,542 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 03:12:52,545 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-30 03:12:52,571 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bd06ce8c/00232866e5e341d0945dede6f737f66e/FLAG882a964b6 [2023-08-30 03:12:52,598 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bd06ce8c/00232866e5e341d0945dede6f737f66e [2023-08-30 03:12:52,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 03:12:52,603 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 03:12:52,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 03:12:52,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 03:12:52,611 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 03:12:52,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:12:52" (1/1) ... [2023-08-30 03:12:52,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e5e02f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:52, skipping insertion in model container [2023-08-30 03:12:52,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:12:52" (1/1) ... [2023-08-30 03:12:52,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 03:12:52,667 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 03:12:52,849 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-08-30 03:12:53,073 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:12:53,087 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 03:12:53,100 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-08-30 03:12:53,171 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:12:53,208 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:12:53,209 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:12:53,214 INFO L208 MainTranslator]: Completed translation [2023-08-30 03:12:53,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:53 WrapperNode [2023-08-30 03:12:53,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 03:12:53,216 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 03:12:53,216 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 03:12:53,216 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 03:12:53,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:53" (1/1) ... [2023-08-30 03:12:53,253 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:53" (1/1) ... [2023-08-30 03:12:53,289 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-08-30 03:12:53,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 03:12:53,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 03:12:53,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 03:12:53,291 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 03:12:53,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:53" (1/1) ... [2023-08-30 03:12:53,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:53" (1/1) ... [2023-08-30 03:12:53,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:53" (1/1) ... [2023-08-30 03:12:53,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:53" (1/1) ... [2023-08-30 03:12:53,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:53" (1/1) ... [2023-08-30 03:12:53,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:53" (1/1) ... [2023-08-30 03:12:53,332 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:53" (1/1) ... [2023-08-30 03:12:53,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:53" (1/1) ... [2023-08-30 03:12:53,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 03:12:53,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 03:12:53,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 03:12:53,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 03:12:53,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:53" (1/1) ... [2023-08-30 03:12:53,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:12:53,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 03:12:53,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 03:12:53,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 03:12:53,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 03:12:53,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 03:12:53,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 03:12:53,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 03:12:53,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 03:12:53,410 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 03:12:53,410 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 03:12:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 03:12:53,411 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 03:12:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 03:12:53,411 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 03:12:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 03:12:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 03:12:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 03:12:53,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 03:12:53,413 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 03:12:53,618 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 03:12:53,620 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 03:12:53,977 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 03:12:54,109 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 03:12:54,109 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 03:12:54,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:12:54 BoogieIcfgContainer [2023-08-30 03:12:54,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 03:12:54,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 03:12:54,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 03:12:54,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 03:12:54,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 03:12:52" (1/3) ... [2023-08-30 03:12:54,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4988cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:12:54, skipping insertion in model container [2023-08-30 03:12:54,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:53" (2/3) ... [2023-08-30 03:12:54,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4988cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:12:54, skipping insertion in model container [2023-08-30 03:12:54,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:12:54" (3/3) ... [2023-08-30 03:12:54,129 INFO L112 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-30 03:12:54,145 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 03:12:54,145 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-30 03:12:54,145 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 03:12:54,198 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 03:12:54,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2023-08-30 03:12:54,277 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2023-08-30 03:12:54,277 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:12:54,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-30 03:12:54,284 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2023-08-30 03:12:54,292 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2023-08-30 03:12:54,296 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 03:12:54,309 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2023-08-30 03:12:54,315 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2023-08-30 03:12:54,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2023-08-30 03:12:54,366 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2023-08-30 03:12:54,368 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:12:54,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-30 03:12:54,371 INFO L119 LiptonReduction]: Number of co-enabled transitions 2032 [2023-08-30 03:12:59,718 INFO L134 LiptonReduction]: Checked pairs total: 4845 [2023-08-30 03:12:59,718 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-08-30 03:12:59,730 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 03:12:59,735 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;@58985b46, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 03:12:59,735 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-30 03:12:59,736 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 03:12:59,737 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:12:59,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:12:59,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 03:12:59,738 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:12:59,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:12:59,742 INFO L85 PathProgramCache]: Analyzing trace with hash 502, now seen corresponding path program 1 times [2023-08-30 03:12:59,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:12:59,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209228617] [2023-08-30 03:12:59,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:12:59,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:12:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:12:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:12:59,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:12:59,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209228617] [2023-08-30 03:12:59,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209228617] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:12:59,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:12:59,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 03:12:59,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002339010] [2023-08-30 03:12:59,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:12:59,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 03:12:59,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:12:59,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 03:12:59,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 03:12:59,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 222 [2023-08-30 03:12:59,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 67 flow. Second operand has 2 states, 2 states have (on average 102.5) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:12:59,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:12:59,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 222 [2023-08-30 03:12:59,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:00,377 INFO L130 PetriNetUnfolder]: 1095/1657 cut-off events. [2023-08-30 03:13:00,378 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-08-30 03:13:00,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3340 conditions, 1657 events. 1095/1657 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7518 event pairs, 1095 based on Foata normal form. 0/1365 useless extension candidates. Maximal degree in co-relation 3329. Up to 1627 conditions per place. [2023-08-30 03:13:00,390 INFO L137 encePairwiseOnDemand]: 216/222 looper letters, 21 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2023-08-30 03:13:00,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 97 flow [2023-08-30 03:13:00,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 03:13:00,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 03:13:00,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 231 transitions. [2023-08-30 03:13:00,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5202702702702703 [2023-08-30 03:13:00,403 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 231 transitions. [2023-08-30 03:13:00,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 231 transitions. [2023-08-30 03:13:00,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:00,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 231 transitions. [2023-08-30 03:13:00,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 115.5) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:00,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:00,414 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:00,415 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 67 flow. Second operand 2 states and 231 transitions. [2023-08-30 03:13:00,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 97 flow [2023-08-30 03:13:00,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 03:13:00,419 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 52 flow [2023-08-30 03:13:00,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2023-08-30 03:13:00,424 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -8 predicate places. [2023-08-30 03:13:00,424 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 52 flow [2023-08-30 03:13:00,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 102.5) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:00,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:00,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 03:13:00,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 03:13:00,426 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:00,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:00,426 INFO L85 PathProgramCache]: Analyzing trace with hash 493236, now seen corresponding path program 1 times [2023-08-30 03:13:00,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:13:00,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136925578] [2023-08-30 03:13:00,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:00,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:13:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:00,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 03:13:00,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:13:00,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136925578] [2023-08-30 03:13:00,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136925578] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:00,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:00,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:13:00,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427293844] [2023-08-30 03:13:00,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:00,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:13:00,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:13:00,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:13:00,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:13:00,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 222 [2023-08-30 03:13:00,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:00,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:00,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 222 [2023-08-30 03:13:00,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:00,926 INFO L130 PetriNetUnfolder]: 855/1392 cut-off events. [2023-08-30 03:13:00,927 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:13:00,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2717 conditions, 1392 events. 855/1392 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7192 event pairs, 135 based on Foata normal form. 0/1259 useless extension candidates. Maximal degree in co-relation 2714. Up to 1039 conditions per place. [2023-08-30 03:13:00,935 INFO L137 encePairwiseOnDemand]: 219/222 looper letters, 31 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-08-30 03:13:00,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 154 flow [2023-08-30 03:13:00,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:13:00,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:13:00,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2023-08-30 03:13:00,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509009009009009 [2023-08-30 03:13:00,942 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2023-08-30 03:13:00,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2023-08-30 03:13:00,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:00,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2023-08-30 03:13:00,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:00,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:00,949 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:00,949 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 52 flow. Second operand 3 states and 339 transitions. [2023-08-30 03:13:00,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 154 flow [2023-08-30 03:13:00,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 03:13:00,950 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-08-30 03:13:00,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-08-30 03:13:00,951 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -7 predicate places. [2023-08-30 03:13:00,951 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-08-30 03:13:00,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:00,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:00,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:00,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 03:13:00,953 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:00,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:00,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1417657759, now seen corresponding path program 1 times [2023-08-30 03:13:00,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:13:00,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835571998] [2023-08-30 03:13:00,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:00,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:13:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:02,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:02,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:13:02,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835571998] [2023-08-30 03:13:02,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835571998] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:02,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:02,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:13:02,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549725593] [2023-08-30 03:13:02,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:02,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:13:02,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:13:02,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:13:02,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:13:02,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 222 [2023-08-30 03:13:02,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:02,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:02,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 222 [2023-08-30 03:13:02,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:02,596 INFO L130 PetriNetUnfolder]: 1037/1656 cut-off events. [2023-08-30 03:13:02,596 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2023-08-30 03:13:02,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3387 conditions, 1656 events. 1037/1656 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7899 event pairs, 215 based on Foata normal form. 0/1596 useless extension candidates. Maximal degree in co-relation 3383. Up to 1040 conditions per place. [2023-08-30 03:13:02,605 INFO L137 encePairwiseOnDemand]: 211/222 looper letters, 32 selfloop transitions, 10 changer transitions 0/43 dead transitions. [2023-08-30 03:13:02,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 43 transitions, 184 flow [2023-08-30 03:13:02,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:13:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:13:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 416 transitions. [2023-08-30 03:13:02,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46846846846846846 [2023-08-30 03:13:02,607 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 416 transitions. [2023-08-30 03:13:02,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 416 transitions. [2023-08-30 03:13:02,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:02,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 416 transitions. [2023-08-30 03:13:02,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:02,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:02,612 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:02,612 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 4 states and 416 transitions. [2023-08-30 03:13:02,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 43 transitions, 184 flow [2023-08-30 03:13:02,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 43 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:13:02,614 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 124 flow [2023-08-30 03:13:02,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2023-08-30 03:13:02,615 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -4 predicate places. [2023-08-30 03:13:02,618 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 124 flow [2023-08-30 03:13:02,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:02,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:02,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:02,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 03:13:02,619 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:02,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:02,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1417657742, now seen corresponding path program 1 times [2023-08-30 03:13:02,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:13:02,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657918794] [2023-08-30 03:13:02,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:02,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:13:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:03,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:03,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:13:03,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657918794] [2023-08-30 03:13:03,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657918794] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:03,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:03,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:13:03,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775558251] [2023-08-30 03:13:03,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:03,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:13:03,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:13:03,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:13:03,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:13:03,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 222 [2023-08-30 03:13:03,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:03,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:03,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 222 [2023-08-30 03:13:03,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:03,363 INFO L130 PetriNetUnfolder]: 695/1069 cut-off events. [2023-08-30 03:13:03,364 INFO L131 PetriNetUnfolder]: For 661/685 co-relation queries the response was YES. [2023-08-30 03:13:03,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3088 conditions, 1069 events. 695/1069 cut-off events. For 661/685 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4619 event pairs, 160 based on Foata normal form. 104/1125 useless extension candidates. Maximal degree in co-relation 3082. Up to 984 conditions per place. [2023-08-30 03:13:03,370 INFO L137 encePairwiseOnDemand]: 218/222 looper letters, 29 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2023-08-30 03:13:03,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 35 transitions, 202 flow [2023-08-30 03:13:03,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:13:03,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:13:03,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2023-08-30 03:13:03,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41711711711711713 [2023-08-30 03:13:03,373 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 463 transitions. [2023-08-30 03:13:03,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 463 transitions. [2023-08-30 03:13:03,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:03,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 463 transitions. [2023-08-30 03:13:03,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 92.6) internal successors, (463), 5 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:03,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:03,377 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:03,377 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 124 flow. Second operand 5 states and 463 transitions. [2023-08-30 03:13:03,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 35 transitions, 202 flow [2023-08-30 03:13:03,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 35 transitions, 200 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:13:03,380 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 112 flow [2023-08-30 03:13:03,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2023-08-30 03:13:03,381 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2023-08-30 03:13:03,381 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 112 flow [2023-08-30 03:13:03,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:03,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:03,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:03,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 03:13:03,382 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:03,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:03,383 INFO L85 PathProgramCache]: Analyzing trace with hash -998342817, now seen corresponding path program 1 times [2023-08-30 03:13:03,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:13:03,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616924197] [2023-08-30 03:13:03,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:03,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:13:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:04,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:13:04,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616924197] [2023-08-30 03:13:04,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616924197] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:04,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:04,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:13:04,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880870809] [2023-08-30 03:13:04,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:04,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:13:04,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:13:04,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:13:04,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:13:04,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 222 [2023-08-30 03:13:04,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:04,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:04,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 222 [2023-08-30 03:13:04,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:04,667 INFO L130 PetriNetUnfolder]: 1092/1725 cut-off events. [2023-08-30 03:13:04,667 INFO L131 PetriNetUnfolder]: For 781/787 co-relation queries the response was YES. [2023-08-30 03:13:04,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4863 conditions, 1725 events. 1092/1725 cut-off events. For 781/787 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 8594 event pairs, 173 based on Foata normal form. 60/1783 useless extension candidates. Maximal degree in co-relation 4856. Up to 897 conditions per place. [2023-08-30 03:13:04,677 INFO L137 encePairwiseOnDemand]: 213/222 looper letters, 35 selfloop transitions, 9 changer transitions 12/57 dead transitions. [2023-08-30 03:13:04,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 57 transitions, 343 flow [2023-08-30 03:13:04,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:13:04,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:13:04,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 516 transitions. [2023-08-30 03:13:04,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4648648648648649 [2023-08-30 03:13:04,679 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 516 transitions. [2023-08-30 03:13:04,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 516 transitions. [2023-08-30 03:13:04,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:04,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 516 transitions. [2023-08-30 03:13:04,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:04,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:04,684 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:04,684 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 112 flow. Second operand 5 states and 516 transitions. [2023-08-30 03:13:04,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 57 transitions, 343 flow [2023-08-30 03:13:04,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 57 transitions, 335 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 03:13:04,690 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 141 flow [2023-08-30 03:13:04,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-30 03:13:04,694 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2023-08-30 03:13:04,694 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 141 flow [2023-08-30 03:13:04,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:04,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:04,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:04,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 03:13:04,695 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:04,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:04,696 INFO L85 PathProgramCache]: Analyzing trace with hash -864537529, now seen corresponding path program 1 times [2023-08-30 03:13:04,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:13:04,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084175116] [2023-08-30 03:13:04,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:04,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:13:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:05,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:13:05,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084175116] [2023-08-30 03:13:05,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084175116] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:05,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:05,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:13:05,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302410149] [2023-08-30 03:13:05,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:05,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:13:05,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:13:05,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:13:05,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:13:05,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 222 [2023-08-30 03:13:05,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:05,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:05,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 222 [2023-08-30 03:13:05,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:06,028 INFO L130 PetriNetUnfolder]: 906/1373 cut-off events. [2023-08-30 03:13:06,028 INFO L131 PetriNetUnfolder]: For 1264/1264 co-relation queries the response was YES. [2023-08-30 03:13:06,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4449 conditions, 1373 events. 906/1373 cut-off events. For 1264/1264 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5556 event pairs, 279 based on Foata normal form. 6/1379 useless extension candidates. Maximal degree in co-relation 4440. Up to 1162 conditions per place. [2023-08-30 03:13:06,036 INFO L137 encePairwiseOnDemand]: 211/222 looper letters, 37 selfloop transitions, 17 changer transitions 0/54 dead transitions. [2023-08-30 03:13:06,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 351 flow [2023-08-30 03:13:06,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:13:06,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:13:06,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 417 transitions. [2023-08-30 03:13:06,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46959459459459457 [2023-08-30 03:13:06,039 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 417 transitions. [2023-08-30 03:13:06,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 417 transitions. [2023-08-30 03:13:06,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:06,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 417 transitions. [2023-08-30 03:13:06,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:06,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:06,042 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:06,042 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 141 flow. Second operand 4 states and 417 transitions. [2023-08-30 03:13:06,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 351 flow [2023-08-30 03:13:06,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 327 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-30 03:13:06,046 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 232 flow [2023-08-30 03:13:06,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=232, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2023-08-30 03:13:06,046 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2023-08-30 03:13:06,047 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 232 flow [2023-08-30 03:13:06,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:06,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:06,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:06,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 03:13:06,048 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:06,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:06,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1030231386, now seen corresponding path program 1 times [2023-08-30 03:13:06,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:13:06,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133613270] [2023-08-30 03:13:06,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:06,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:13:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:06,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:06,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:13:06,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133613270] [2023-08-30 03:13:06,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133613270] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:06,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:06,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:13:06,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739746119] [2023-08-30 03:13:06,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:06,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:13:06,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:13:06,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:13:06,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:13:06,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 222 [2023-08-30 03:13:06,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 232 flow. Second operand has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:06,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:06,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 222 [2023-08-30 03:13:06,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:07,136 INFO L130 PetriNetUnfolder]: 973/1585 cut-off events. [2023-08-30 03:13:07,137 INFO L131 PetriNetUnfolder]: For 2710/2806 co-relation queries the response was YES. [2023-08-30 03:13:07,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5763 conditions, 1585 events. 973/1585 cut-off events. For 2710/2806 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7736 event pairs, 264 based on Foata normal form. 48/1621 useless extension candidates. Maximal degree in co-relation 5753. Up to 808 conditions per place. [2023-08-30 03:13:07,147 INFO L137 encePairwiseOnDemand]: 216/222 looper letters, 46 selfloop transitions, 8 changer transitions 3/59 dead transitions. [2023-08-30 03:13:07,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 59 transitions, 448 flow [2023-08-30 03:13:07,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:13:07,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:13:07,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 414 transitions. [2023-08-30 03:13:07,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46621621621621623 [2023-08-30 03:13:07,150 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 414 transitions. [2023-08-30 03:13:07,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 414 transitions. [2023-08-30 03:13:07,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:07,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 414 transitions. [2023-08-30 03:13:07,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:07,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:07,154 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:07,154 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 232 flow. Second operand 4 states and 414 transitions. [2023-08-30 03:13:07,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 59 transitions, 448 flow [2023-08-30 03:13:07,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 446 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-30 03:13:07,158 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 264 flow [2023-08-30 03:13:07,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=264, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2023-08-30 03:13:07,159 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 8 predicate places. [2023-08-30 03:13:07,160 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 264 flow [2023-08-30 03:13:07,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:07,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:07,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:07,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 03:13:07,161 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:07,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:07,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1080729394, now seen corresponding path program 1 times [2023-08-30 03:13:07,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:13:07,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94652995] [2023-08-30 03:13:07,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:07,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:13:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:07,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:07,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:13:07,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94652995] [2023-08-30 03:13:07,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94652995] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:07,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:07,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:13:07,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990254522] [2023-08-30 03:13:07,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:07,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:13:07,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:13:07,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:13:07,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:13:07,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 222 [2023-08-30 03:13:07,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 264 flow. Second operand has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:07,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:07,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 222 [2023-08-30 03:13:07,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:07,790 INFO L130 PetriNetUnfolder]: 979/1549 cut-off events. [2023-08-30 03:13:07,791 INFO L131 PetriNetUnfolder]: For 3034/3081 co-relation queries the response was YES. [2023-08-30 03:13:07,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5931 conditions, 1549 events. 979/1549 cut-off events. For 3034/3081 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7101 event pairs, 334 based on Foata normal form. 51/1597 useless extension candidates. Maximal degree in co-relation 5918. Up to 1353 conditions per place. [2023-08-30 03:13:07,804 INFO L137 encePairwiseOnDemand]: 216/222 looper letters, 50 selfloop transitions, 8 changer transitions 2/62 dead transitions. [2023-08-30 03:13:07,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 62 transitions, 517 flow [2023-08-30 03:13:07,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:13:07,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:13:07,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 440 transitions. [2023-08-30 03:13:07,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2023-08-30 03:13:07,807 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 440 transitions. [2023-08-30 03:13:07,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 440 transitions. [2023-08-30 03:13:07,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:07,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 440 transitions. [2023-08-30 03:13:07,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:07,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:07,810 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:07,810 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 264 flow. Second operand 4 states and 440 transitions. [2023-08-30 03:13:07,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 62 transitions, 517 flow [2023-08-30 03:13:07,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 62 transitions, 485 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-30 03:13:07,815 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 289 flow [2023-08-30 03:13:07,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=289, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-08-30 03:13:07,816 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 10 predicate places. [2023-08-30 03:13:07,816 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 289 flow [2023-08-30 03:13:07,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:07,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:07,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:07,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 03:13:07,817 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:07,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:07,818 INFO L85 PathProgramCache]: Analyzing trace with hash 457812626, now seen corresponding path program 1 times [2023-08-30 03:13:07,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:13:07,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115898082] [2023-08-30 03:13:07,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:07,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:13:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:08,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:08,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:13:08,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115898082] [2023-08-30 03:13:08,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115898082] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:08,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:08,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:13:08,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177184731] [2023-08-30 03:13:08,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:08,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:13:08,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:13:08,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:13:08,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:13:08,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 222 [2023-08-30 03:13:08,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 289 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:08,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:08,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 222 [2023-08-30 03:13:08,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:08,530 INFO L130 PetriNetUnfolder]: 920/1472 cut-off events. [2023-08-30 03:13:08,530 INFO L131 PetriNetUnfolder]: For 3337/3375 co-relation queries the response was YES. [2023-08-30 03:13:08,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5962 conditions, 1472 events. 920/1472 cut-off events. For 3337/3375 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6724 event pairs, 442 based on Foata normal form. 38/1510 useless extension candidates. Maximal degree in co-relation 5948. Up to 1297 conditions per place. [2023-08-30 03:13:08,542 INFO L137 encePairwiseOnDemand]: 218/222 looper letters, 49 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2023-08-30 03:13:08,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 57 transitions, 483 flow [2023-08-30 03:13:08,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:13:08,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:13:08,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 438 transitions. [2023-08-30 03:13:08,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49324324324324326 [2023-08-30 03:13:08,545 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 438 transitions. [2023-08-30 03:13:08,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 438 transitions. [2023-08-30 03:13:08,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:08,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 438 transitions. [2023-08-30 03:13:08,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:08,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:08,548 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:08,549 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 289 flow. Second operand 4 states and 438 transitions. [2023-08-30 03:13:08,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 57 transitions, 483 flow [2023-08-30 03:13:08,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 57 transitions, 464 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-30 03:13:08,553 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 288 flow [2023-08-30 03:13:08,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-08-30 03:13:08,555 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 11 predicate places. [2023-08-30 03:13:08,555 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 288 flow [2023-08-30 03:13:08,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:08,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:08,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:08,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 03:13:08,556 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:08,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:08,557 INFO L85 PathProgramCache]: Analyzing trace with hash 855559165, now seen corresponding path program 1 times [2023-08-30 03:13:08,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:13:08,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996758055] [2023-08-30 03:13:08,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:08,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:13:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:09,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:09,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:13:09,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996758055] [2023-08-30 03:13:09,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996758055] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:09,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:09,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:13:09,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403531989] [2023-08-30 03:13:09,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:09,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:13:09,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:13:09,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:13:09,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:13:09,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 222 [2023-08-30 03:13:09,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 288 flow. Second operand has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:09,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:09,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 222 [2023-08-30 03:13:09,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:09,582 INFO L130 PetriNetUnfolder]: 952/1516 cut-off events. [2023-08-30 03:13:09,582 INFO L131 PetriNetUnfolder]: For 3512/3550 co-relation queries the response was YES. [2023-08-30 03:13:09,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6180 conditions, 1516 events. 952/1516 cut-off events. For 3512/3550 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6944 event pairs, 254 based on Foata normal form. 48/1558 useless extension candidates. Maximal degree in co-relation 6166. Up to 1224 conditions per place. [2023-08-30 03:13:09,599 INFO L137 encePairwiseOnDemand]: 215/222 looper letters, 55 selfloop transitions, 18 changer transitions 4/79 dead transitions. [2023-08-30 03:13:09,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 79 transitions, 678 flow [2023-08-30 03:13:09,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:13:09,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:13:09,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 541 transitions. [2023-08-30 03:13:09,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4873873873873874 [2023-08-30 03:13:09,602 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 541 transitions. [2023-08-30 03:13:09,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 541 transitions. [2023-08-30 03:13:09,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:09,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 541 transitions. [2023-08-30 03:13:09,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:09,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:09,606 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:09,606 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 288 flow. Second operand 5 states and 541 transitions. [2023-08-30 03:13:09,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 79 transitions, 678 flow [2023-08-30 03:13:09,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 79 transitions, 665 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:13:09,613 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 440 flow [2023-08-30 03:13:09,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=440, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2023-08-30 03:13:09,615 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 16 predicate places. [2023-08-30 03:13:09,615 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 440 flow [2023-08-30 03:13:09,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:09,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:09,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:09,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 03:13:09,616 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:09,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:09,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1899623195, now seen corresponding path program 1 times [2023-08-30 03:13:09,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:13:09,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370978742] [2023-08-30 03:13:09,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:09,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:13:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:10,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:10,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:13:10,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370978742] [2023-08-30 03:13:10,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370978742] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:10,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:10,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:13:10,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933724705] [2023-08-30 03:13:10,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:10,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:13:10,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:13:10,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:13:10,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:13:10,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 222 [2023-08-30 03:13:10,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 440 flow. Second operand has 5 states, 5 states have (on average 92.6) internal successors, (463), 5 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:10,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:10,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 222 [2023-08-30 03:13:10,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:10,890 INFO L130 PetriNetUnfolder]: 990/1570 cut-off events. [2023-08-30 03:13:10,890 INFO L131 PetriNetUnfolder]: For 4986/4986 co-relation queries the response was YES. [2023-08-30 03:13:10,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7105 conditions, 1570 events. 990/1570 cut-off events. For 4986/4986 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7107 event pairs, 399 based on Foata normal form. 3/1573 useless extension candidates. Maximal degree in co-relation 7088. Up to 1264 conditions per place. [2023-08-30 03:13:10,907 INFO L137 encePairwiseOnDemand]: 211/222 looper letters, 55 selfloop transitions, 27 changer transitions 4/86 dead transitions. [2023-08-30 03:13:10,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 86 transitions, 808 flow [2023-08-30 03:13:10,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:13:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:13:10,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 601 transitions. [2023-08-30 03:13:10,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4512012012012012 [2023-08-30 03:13:10,910 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 601 transitions. [2023-08-30 03:13:10,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 601 transitions. [2023-08-30 03:13:10,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:10,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 601 transitions. [2023-08-30 03:13:10,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:10,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:10,916 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:10,916 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 440 flow. Second operand 6 states and 601 transitions. [2023-08-30 03:13:10,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 86 transitions, 808 flow [2023-08-30 03:13:10,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 86 transitions, 796 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-08-30 03:13:10,924 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 581 flow [2023-08-30 03:13:10,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=581, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2023-08-30 03:13:10,924 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 23 predicate places. [2023-08-30 03:13:10,925 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 581 flow [2023-08-30 03:13:10,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.6) internal successors, (463), 5 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:10,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:10,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:10,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 03:13:10,926 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:10,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:10,926 INFO L85 PathProgramCache]: Analyzing trace with hash 221276101, now seen corresponding path program 2 times [2023-08-30 03:13:10,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:13:10,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081573447] [2023-08-30 03:13:10,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:10,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:13:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:11,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:11,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:13:11,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081573447] [2023-08-30 03:13:11,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081573447] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:11,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:11,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:13:11,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492117239] [2023-08-30 03:13:11,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:11,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:13:11,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:13:11,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:13:11,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:13:11,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 222 [2023-08-30 03:13:11,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 581 flow. Second operand has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:11,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:11,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 222 [2023-08-30 03:13:11,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:11,613 INFO L130 PetriNetUnfolder]: 945/1537 cut-off events. [2023-08-30 03:13:11,613 INFO L131 PetriNetUnfolder]: For 7697/7759 co-relation queries the response was YES. [2023-08-30 03:13:11,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7903 conditions, 1537 events. 945/1537 cut-off events. For 7697/7759 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7312 event pairs, 354 based on Foata normal form. 73/1604 useless extension candidates. Maximal degree in co-relation 7884. Up to 1123 conditions per place. [2023-08-30 03:13:11,626 INFO L137 encePairwiseOnDemand]: 214/222 looper letters, 60 selfloop transitions, 30 changer transitions 7/100 dead transitions. [2023-08-30 03:13:11,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 100 transitions, 1100 flow [2023-08-30 03:13:11,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:13:11,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:13:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 649 transitions. [2023-08-30 03:13:11,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4872372372372372 [2023-08-30 03:13:11,629 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 649 transitions. [2023-08-30 03:13:11,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 649 transitions. [2023-08-30 03:13:11,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:11,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 649 transitions. [2023-08-30 03:13:11,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:11,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:11,633 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:11,634 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 581 flow. Second operand 6 states and 649 transitions. [2023-08-30 03:13:11,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 100 transitions, 1100 flow [2023-08-30 03:13:11,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 100 transitions, 1082 flow, removed 7 selfloop flow, removed 1 redundant places. [2023-08-30 03:13:11,647 INFO L231 Difference]: Finished difference. Result has 68 places, 67 transitions, 789 flow [2023-08-30 03:13:11,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=789, PETRI_PLACES=68, PETRI_TRANSITIONS=67} [2023-08-30 03:13:11,648 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 29 predicate places. [2023-08-30 03:13:11,648 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 67 transitions, 789 flow [2023-08-30 03:13:11,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:11,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:11,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:11,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 03:13:11,649 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:11,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:11,650 INFO L85 PathProgramCache]: Analyzing trace with hash -169966833, now seen corresponding path program 1 times [2023-08-30 03:13:11,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:13:11,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273408615] [2023-08-30 03:13:11,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:11,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:13:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:11,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:13:11,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273408615] [2023-08-30 03:13:11,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273408615] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:11,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:11,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:13:11,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143936593] [2023-08-30 03:13:11,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:11,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:13:11,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:13:11,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:13:11,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:13:12,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 222 [2023-08-30 03:13:12,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 789 flow. Second operand has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:12,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:12,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 222 [2023-08-30 03:13:12,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:12,239 INFO L130 PetriNetUnfolder]: 663/1196 cut-off events. [2023-08-30 03:13:12,240 INFO L131 PetriNetUnfolder]: For 10551/10696 co-relation queries the response was YES. [2023-08-30 03:13:12,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6509 conditions, 1196 events. 663/1196 cut-off events. For 10551/10696 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6406 event pairs, 100 based on Foata normal form. 235/1422 useless extension candidates. Maximal degree in co-relation 6487. Up to 581 conditions per place. [2023-08-30 03:13:12,249 INFO L137 encePairwiseOnDemand]: 216/222 looper letters, 85 selfloop transitions, 5 changer transitions 9/107 dead transitions. [2023-08-30 03:13:12,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 107 transitions, 1444 flow [2023-08-30 03:13:12,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:13:12,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:13:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 427 transitions. [2023-08-30 03:13:12,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48085585585585583 [2023-08-30 03:13:12,252 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 427 transitions. [2023-08-30 03:13:12,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 427 transitions. [2023-08-30 03:13:12,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:12,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 427 transitions. [2023-08-30 03:13:12,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:12,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:12,256 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:12,256 INFO L175 Difference]: Start difference. First operand has 68 places, 67 transitions, 789 flow. Second operand 4 states and 427 transitions. [2023-08-30 03:13:12,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 107 transitions, 1444 flow [2023-08-30 03:13:12,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 107 transitions, 1393 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-08-30 03:13:12,269 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 704 flow [2023-08-30 03:13:12,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=704, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2023-08-30 03:13:12,270 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 32 predicate places. [2023-08-30 03:13:12,270 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 704 flow [2023-08-30 03:13:12,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:12,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:12,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:12,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 03:13:12,271 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:12,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:12,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1397370602, now seen corresponding path program 1 times [2023-08-30 03:13:12,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:13:12,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126178210] [2023-08-30 03:13:12,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:12,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:13:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:12,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:12,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:13:12,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126178210] [2023-08-30 03:13:12,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126178210] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:12,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:12,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:13:12,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541788309] [2023-08-30 03:13:12,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:12,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:13:12,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:13:12,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:13:12,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:13:12,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 222 [2023-08-30 03:13:12,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 704 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:12,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:12,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 222 [2023-08-30 03:13:12,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:12,767 INFO L130 PetriNetUnfolder]: 334/651 cut-off events. [2023-08-30 03:13:12,767 INFO L131 PetriNetUnfolder]: For 6137/6188 co-relation queries the response was YES. [2023-08-30 03:13:12,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3796 conditions, 651 events. 334/651 cut-off events. For 6137/6188 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3135 event pairs, 45 based on Foata normal form. 120/767 useless extension candidates. Maximal degree in co-relation 3771. Up to 289 conditions per place. [2023-08-30 03:13:12,772 INFO L137 encePairwiseOnDemand]: 216/222 looper letters, 76 selfloop transitions, 8 changer transitions 11/103 dead transitions. [2023-08-30 03:13:12,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 103 transitions, 1313 flow [2023-08-30 03:13:12,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:13:12,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:13:12,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2023-08-30 03:13:12,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810810810810811 [2023-08-30 03:13:12,775 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 534 transitions. [2023-08-30 03:13:12,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 534 transitions. [2023-08-30 03:13:12,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:12,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 534 transitions. [2023-08-30 03:13:12,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:12,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:12,779 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:12,779 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 704 flow. Second operand 5 states and 534 transitions. [2023-08-30 03:13:12,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 103 transitions, 1313 flow [2023-08-30 03:13:12,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 103 transitions, 1271 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-30 03:13:12,788 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 631 flow [2023-08-30 03:13:12,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=631, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2023-08-30 03:13:12,789 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 35 predicate places. [2023-08-30 03:13:12,789 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 631 flow [2023-08-30 03:13:12,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:12,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:12,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:12,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 03:13:12,790 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:12,790 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:12,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1059031841, now seen corresponding path program 1 times [2023-08-30 03:13:12,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:13:12,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035619497] [2023-08-30 03:13:12,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:12,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:13:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:13,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:13,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:13:13,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035619497] [2023-08-30 03:13:13,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035619497] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:13,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:13,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:13:13,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049107368] [2023-08-30 03:13:13,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:13,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:13:13,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:13:13,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:13:13,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:13:13,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 222 [2023-08-30 03:13:13,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 58 transitions, 631 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:13,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:13,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 222 [2023-08-30 03:13:13,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:13,325 INFO L130 PetriNetUnfolder]: 202/411 cut-off events. [2023-08-30 03:13:13,326 INFO L131 PetriNetUnfolder]: For 3148/3170 co-relation queries the response was YES. [2023-08-30 03:13:13,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2487 conditions, 411 events. 202/411 cut-off events. For 3148/3170 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1797 event pairs, 35 based on Foata normal form. 41/450 useless extension candidates. Maximal degree in co-relation 2461. Up to 172 conditions per place. [2023-08-30 03:13:13,330 INFO L137 encePairwiseOnDemand]: 216/222 looper letters, 43 selfloop transitions, 11 changer transitions 31/89 dead transitions. [2023-08-30 03:13:13,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 89 transitions, 1116 flow [2023-08-30 03:13:13,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:13:13,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:13:13,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 621 transitions. [2023-08-30 03:13:13,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46621621621621623 [2023-08-30 03:13:13,334 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 621 transitions. [2023-08-30 03:13:13,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 621 transitions. [2023-08-30 03:13:13,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:13,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 621 transitions. [2023-08-30 03:13:13,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:13,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:13,338 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:13,338 INFO L175 Difference]: Start difference. First operand has 74 places, 58 transitions, 631 flow. Second operand 6 states and 621 transitions. [2023-08-30 03:13:13,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 89 transitions, 1116 flow [2023-08-30 03:13:13,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 89 transitions, 1050 flow, removed 17 selfloop flow, removed 7 redundant places. [2023-08-30 03:13:13,351 INFO L231 Difference]: Finished difference. Result has 74 places, 39 transitions, 377 flow [2023-08-30 03:13:13,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=377, PETRI_PLACES=74, PETRI_TRANSITIONS=39} [2023-08-30 03:13:13,352 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 35 predicate places. [2023-08-30 03:13:13,352 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 39 transitions, 377 flow [2023-08-30 03:13:13,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:13,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:13,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:13,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 03:13:13,353 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:13,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:13,354 INFO L85 PathProgramCache]: Analyzing trace with hash 495273293, now seen corresponding path program 1 times [2023-08-30 03:13:13,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:13:13,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546095599] [2023-08-30 03:13:13,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:13,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:13:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:14,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:14,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:13:14,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546095599] [2023-08-30 03:13:14,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546095599] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:14,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:14,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:13:14,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361182677] [2023-08-30 03:13:14,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:14,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:13:14,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:13:14,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:13:14,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:13:14,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 222 [2023-08-30 03:13:14,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 39 transitions, 377 flow. Second operand has 7 states, 7 states have (on average 98.71428571428571) internal successors, (691), 7 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:14,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:14,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 222 [2023-08-30 03:13:14,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:14,253 INFO L130 PetriNetUnfolder]: 145/281 cut-off events. [2023-08-30 03:13:14,254 INFO L131 PetriNetUnfolder]: For 1427/1427 co-relation queries the response was YES. [2023-08-30 03:13:14,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1625 conditions, 281 events. 145/281 cut-off events. For 1427/1427 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 958 event pairs, 18 based on Foata normal form. 1/282 useless extension candidates. Maximal degree in co-relation 1601. Up to 185 conditions per place. [2023-08-30 03:13:14,256 INFO L137 encePairwiseOnDemand]: 216/222 looper letters, 44 selfloop transitions, 12 changer transitions 6/63 dead transitions. [2023-08-30 03:13:14,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 63 transitions, 679 flow [2023-08-30 03:13:14,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:13:14,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:13:14,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 519 transitions. [2023-08-30 03:13:14,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46756756756756757 [2023-08-30 03:13:14,259 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 519 transitions. [2023-08-30 03:13:14,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 519 transitions. [2023-08-30 03:13:14,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:14,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 519 transitions. [2023-08-30 03:13:14,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:14,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:14,264 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:14,264 INFO L175 Difference]: Start difference. First operand has 74 places, 39 transitions, 377 flow. Second operand 5 states and 519 transitions. [2023-08-30 03:13:14,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 63 transitions, 679 flow [2023-08-30 03:13:14,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 63 transitions, 461 flow, removed 50 selfloop flow, removed 23 redundant places. [2023-08-30 03:13:14,269 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 285 flow [2023-08-30 03:13:14,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2023-08-30 03:13:14,271 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 13 predicate places. [2023-08-30 03:13:14,271 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 285 flow [2023-08-30 03:13:14,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.71428571428571) internal successors, (691), 7 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:14,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:14,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:14,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 03:13:14,272 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:14,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:14,273 INFO L85 PathProgramCache]: Analyzing trace with hash -959368807, now seen corresponding path program 2 times [2023-08-30 03:13:14,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:13:14,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846210901] [2023-08-30 03:13:14,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:14,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:13:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:15,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:13:15,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846210901] [2023-08-30 03:13:15,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846210901] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:15,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:15,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:13:15,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291120509] [2023-08-30 03:13:15,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:15,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:13:15,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:13:15,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:13:15,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:13:15,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 222 [2023-08-30 03:13:15,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 285 flow. Second operand has 7 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:15,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:15,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 222 [2023-08-30 03:13:15,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:15,444 INFO L130 PetriNetUnfolder]: 145/295 cut-off events. [2023-08-30 03:13:15,445 INFO L131 PetriNetUnfolder]: For 742/742 co-relation queries the response was YES. [2023-08-30 03:13:15,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1276 conditions, 295 events. 145/295 cut-off events. For 742/742 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1077 event pairs, 19 based on Foata normal form. 1/296 useless extension candidates. Maximal degree in co-relation 1263. Up to 147 conditions per place. [2023-08-30 03:13:15,447 INFO L137 encePairwiseOnDemand]: 216/222 looper letters, 37 selfloop transitions, 12 changer transitions 19/69 dead transitions. [2023-08-30 03:13:15,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 549 flow [2023-08-30 03:13:15,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:13:15,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:13:15,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions. [2023-08-30 03:13:15,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4827327327327327 [2023-08-30 03:13:15,449 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 643 transitions. [2023-08-30 03:13:15,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 643 transitions. [2023-08-30 03:13:15,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:15,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 643 transitions. [2023-08-30 03:13:15,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.16666666666667) internal successors, (643), 6 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:15,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:15,454 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:15,454 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 285 flow. Second operand 6 states and 643 transitions. [2023-08-30 03:13:15,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 549 flow [2023-08-30 03:13:15,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 536 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-30 03:13:15,457 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 302 flow [2023-08-30 03:13:15,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=302, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2023-08-30 03:13:15,458 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 18 predicate places. [2023-08-30 03:13:15,458 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 302 flow [2023-08-30 03:13:15,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:15,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:15,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:15,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 03:13:15,459 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:15,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:15,459 INFO L85 PathProgramCache]: Analyzing trace with hash -2024044439, now seen corresponding path program 3 times [2023-08-30 03:13:15,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:13:15,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378687974] [2023-08-30 03:13:15,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:15,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:13:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:13:15,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 03:13:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:13:15,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 03:13:15,600 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 03:13:15,600 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-30 03:13:15,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-30 03:13:15,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-30 03:13:15,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-30 03:13:15,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-30 03:13:15,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-30 03:13:15,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-30 03:13:15,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-30 03:13:15,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-30 03:13:15,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-30 03:13:15,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-30 03:13:15,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-30 03:13:15,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-30 03:13:15,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 03:13:15,604 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:15,609 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 03:13:15,609 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 03:13:15,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 03:13:15 BasicIcfg [2023-08-30 03:13:15,680 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 03:13:15,680 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 03:13:15,683 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 03:13:15,684 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 03:13:15,684 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:12:54" (3/4) ... [2023-08-30 03:13:15,686 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 03:13:15,687 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 03:13:15,687 INFO L158 Benchmark]: Toolchain (without parser) took 23084.53ms. Allocated memory was 88.1MB in the beginning and 432.0MB in the end (delta: 343.9MB). Free memory was 61.1MB in the beginning and 320.4MB in the end (delta: -259.3MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. [2023-08-30 03:13:15,688 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 60.8MB. Free memory was 38.3MB in the beginning and 38.3MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:13:15,688 INFO L158 Benchmark]: CACSL2BoogieTranslator took 611.42ms. Allocated memory is still 88.1MB. Free memory was 61.1MB in the beginning and 59.6MB in the end (delta: 1.5MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2023-08-30 03:13:15,688 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.23ms. Allocated memory is still 88.1MB. Free memory was 59.6MB in the beginning and 56.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:13:15,688 INFO L158 Benchmark]: Boogie Preprocessor took 52.41ms. Allocated memory is still 88.1MB. Free memory was 56.7MB in the beginning and 55.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:13:15,689 INFO L158 Benchmark]: RCFGBuilder took 768.02ms. Allocated memory is still 88.1MB. Free memory was 55.1MB in the beginning and 52.2MB in the end (delta: 2.9MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2023-08-30 03:13:15,689 INFO L158 Benchmark]: TraceAbstraction took 21567.63ms. Allocated memory was 88.1MB in the beginning and 432.0MB in the end (delta: 343.9MB). Free memory was 51.7MB in the beginning and 320.4MB in the end (delta: -268.8MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. [2023-08-30 03:13:15,689 INFO L158 Benchmark]: Witness Printer took 6.35ms. Allocated memory is still 432.0MB. Free memory is still 320.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:13:15,690 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 60.8MB. Free memory was 38.3MB in the beginning and 38.3MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 611.42ms. Allocated memory is still 88.1MB. Free memory was 61.1MB in the beginning and 59.6MB in the end (delta: 1.5MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.23ms. Allocated memory is still 88.1MB. Free memory was 59.6MB in the beginning and 56.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.41ms. Allocated memory is still 88.1MB. Free memory was 56.7MB in the beginning and 55.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 768.02ms. Allocated memory is still 88.1MB. Free memory was 55.1MB in the beginning and 52.2MB in the end (delta: 2.9MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * TraceAbstraction took 21567.63ms. Allocated memory was 88.1MB in the beginning and 432.0MB in the end (delta: 343.9MB). Free memory was 51.7MB in the beginning and 320.4MB in the end (delta: -268.8MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. * Witness Printer took 6.35ms. Allocated memory is still 432.0MB. Free memory is still 320.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 120 PlacesBefore, 39 PlacesAfterwards, 112 TransitionsBefore, 29 TransitionsAfterwards, 2032 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 107 TotalNumberOfCompositions, 4845 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2468, independent: 2321, independent conditional: 0, independent unconditional: 2321, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1111, independent: 1074, independent conditional: 0, independent unconditional: 1074, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2468, independent: 1247, independent conditional: 0, independent unconditional: 1247, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 1111, unknown conditional: 0, unknown unconditional: 1111] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [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$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2177; [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2177, ((void *)0), P0, ((void *)0))=-1, t2177={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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L815] 0 pthread_t t2178; [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2178, ((void *)0), P1, ((void *)0))=0, t2177={5:0}, t2178={6: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L817] 0 pthread_t t2179; [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2179, ((void *)0), P2, ((void *)0))=1, t2177={5:0}, t2178={6:0}, t2179={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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 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) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 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_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 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) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 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 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 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_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 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) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 818]: 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: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 760 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 585 mSDsluCounter, 239 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 236 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1528 IncrementalHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 236 mSolverCounterUnsat, 83 mSDtfsCounter, 1528 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=789occurred in iteration=12, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 187 ConstructedInterpolants, 0 QuantifiedInterpolants, 2913 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 03:13:15,721 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/safe017_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 b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 03:13:17,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 03:13:17,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 03:13:17,704 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 03:13:17,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 03:13:17,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 03:13:17,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 03:13:17,712 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 03:13:17,714 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 03:13:17,720 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 03:13:17,721 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 03:13:17,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 03:13:17,722 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 03:13:17,724 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 03:13:17,726 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 03:13:17,732 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 03:13:17,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 03:13:17,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 03:13:17,738 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 03:13:17,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 03:13:17,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 03:13:17,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 03:13:17,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 03:13:17,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 03:13:17,751 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 03:13:17,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 03:13:17,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 03:13:17,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 03:13:17,758 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 03:13:17,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 03:13:17,759 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 03:13:17,759 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 03:13:17,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 03:13:17,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 03:13:17,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 03:13:17,763 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 03:13:17,764 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 03:13:17,764 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 03:13:17,764 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 03:13:17,765 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 03:13:17,766 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 03:13:17,767 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 03:13:17,803 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 03:13:17,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 03:13:17,804 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 03:13:17,804 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 03:13:17,805 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 03:13:17,805 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 03:13:17,806 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 03:13:17,806 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 03:13:17,806 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 03:13:17,807 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 03:13:17,807 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 03:13:17,808 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 03:13:17,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 03:13:17,808 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 03:13:17,808 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 03:13:17,808 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 03:13:17,808 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 03:13:17,809 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 03:13:17,809 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 03:13:17,809 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 03:13:17,809 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 03:13:17,809 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 03:13:17,810 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 03:13:17,810 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 03:13:17,810 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 03:13:17,810 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 03:13:17,810 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 03:13:17,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:13:17,811 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 03:13:17,811 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 03:13:17,811 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 03:13:17,811 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 03:13:17,812 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 03:13:17,812 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 03:13:17,812 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 03:13:17,812 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 03:13:17,813 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 03:13:17,813 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 -> b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 03:13:18,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 03:13:18,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 03:13:18,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 03:13:18,173 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 03:13:18,173 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 03:13:18,175 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-30 03:13:19,371 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 03:13:19,612 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 03:13:19,613 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-30 03:13:19,626 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/227f0cf38/6019db80361f4064853b9e0a6ec65b6a/FLAG876171e39 [2023-08-30 03:13:19,642 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/227f0cf38/6019db80361f4064853b9e0a6ec65b6a [2023-08-30 03:13:19,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 03:13:19,646 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 03:13:19,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 03:13:19,647 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 03:13:19,650 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 03:13:19,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:13:19" (1/1) ... [2023-08-30 03:13:19,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@579cb33c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:19, skipping insertion in model container [2023-08-30 03:13:19,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:13:19" (1/1) ... [2023-08-30 03:13:19,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 03:13:19,719 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 03:13:19,841 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-08-30 03:13:20,042 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:13:20,058 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 03:13:20,070 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-08-30 03:13:20,106 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:13:20,146 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:13:20,146 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:13:20,152 INFO L208 MainTranslator]: Completed translation [2023-08-30 03:13:20,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:20 WrapperNode [2023-08-30 03:13:20,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 03:13:20,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 03:13:20,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 03:13:20,154 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 03:13:20,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:20" (1/1) ... [2023-08-30 03:13:20,179 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:20" (1/1) ... [2023-08-30 03:13:20,203 INFO L138 Inliner]: procedures = 179, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-08-30 03:13:20,203 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 03:13:20,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 03:13:20,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 03:13:20,204 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 03:13:20,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:20" (1/1) ... [2023-08-30 03:13:20,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:20" (1/1) ... [2023-08-30 03:13:20,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:20" (1/1) ... [2023-08-30 03:13:20,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:20" (1/1) ... [2023-08-30 03:13:20,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:20" (1/1) ... [2023-08-30 03:13:20,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:20" (1/1) ... [2023-08-30 03:13:20,244 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:20" (1/1) ... [2023-08-30 03:13:20,247 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:20" (1/1) ... [2023-08-30 03:13:20,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 03:13:20,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 03:13:20,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 03:13:20,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 03:13:20,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:20" (1/1) ... [2023-08-30 03:13:20,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:13:20,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 03:13:20,295 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 03:13:20,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 03:13:20,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 03:13:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 03:13:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 03:13:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 03:13:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 03:13:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 03:13:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 03:13:20,335 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 03:13:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 03:13:20,336 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 03:13:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 03:13:20,336 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 03:13:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 03:13:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 03:13:20,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 03:13:20,338 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 03:13:20,491 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 03:13:20,492 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 03:13:20,925 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 03:13:21,059 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 03:13:21,060 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 03:13:21,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:13:21 BoogieIcfgContainer [2023-08-30 03:13:21,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 03:13:21,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 03:13:21,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 03:13:21,067 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 03:13:21,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 03:13:19" (1/3) ... [2023-08-30 03:13:21,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270561a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:13:21, skipping insertion in model container [2023-08-30 03:13:21,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:20" (2/3) ... [2023-08-30 03:13:21,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270561a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:13:21, skipping insertion in model container [2023-08-30 03:13:21,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:13:21" (3/3) ... [2023-08-30 03:13:21,069 INFO L112 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-30 03:13:21,082 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 03:13:21,083 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-30 03:13:21,083 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 03:13:21,140 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 03:13:21,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow [2023-08-30 03:13:21,252 INFO L130 PetriNetUnfolder]: 2/113 cut-off events. [2023-08-30 03:13:21,253 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:13:21,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-30 03:13:21,260 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 116 transitions, 247 flow [2023-08-30 03:13:21,265 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 113 transitions, 235 flow [2023-08-30 03:13:21,269 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 03:13:21,287 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 113 transitions, 235 flow [2023-08-30 03:13:21,293 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 113 transitions, 235 flow [2023-08-30 03:13:21,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 235 flow [2023-08-30 03:13:21,334 INFO L130 PetriNetUnfolder]: 2/113 cut-off events. [2023-08-30 03:13:21,334 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:13:21,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-30 03:13:21,338 INFO L119 LiptonReduction]: Number of co-enabled transitions 2032 [2023-08-30 03:13:27,559 INFO L134 LiptonReduction]: Checked pairs total: 4674 [2023-08-30 03:13:27,560 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-08-30 03:13:27,591 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 03:13:27,641 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;@55c2b815, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 03:13:27,641 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-30 03:13:27,642 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 03:13:27,642 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:13:27,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:27,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 03:13:27,643 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:27,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:27,648 INFO L85 PathProgramCache]: Analyzing trace with hash 509, now seen corresponding path program 1 times [2023-08-30 03:13:27,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:27,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442984372] [2023-08-30 03:13:27,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:27,671 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:27,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:27,674 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:27,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-30 03:13:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:27,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 03:13:27,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:27,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:27,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:27,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:27,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442984372] [2023-08-30 03:13:27,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442984372] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:27,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:27,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 03:13:27,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121553813] [2023-08-30 03:13:27,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:27,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 03:13:27,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:27,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 03:13:27,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 03:13:27,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 229 [2023-08-30 03:13:27,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 67 flow. Second operand has 2 states, 2 states have (on average 103.5) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:27,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:27,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 229 [2023-08-30 03:13:27,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:28,254 INFO L130 PetriNetUnfolder]: 1095/1643 cut-off events. [2023-08-30 03:13:28,255 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-30 03:13:28,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3326 conditions, 1643 events. 1095/1643 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7395 event pairs, 1095 based on Foata normal form. 0/1356 useless extension candidates. Maximal degree in co-relation 3315. Up to 1627 conditions per place. [2023-08-30 03:13:28,271 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 21 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2023-08-30 03:13:28,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 97 flow [2023-08-30 03:13:28,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 03:13:28,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 03:13:28,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 233 transitions. [2023-08-30 03:13:28,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5087336244541485 [2023-08-30 03:13:28,288 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 233 transitions. [2023-08-30 03:13:28,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 233 transitions. [2023-08-30 03:13:28,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:28,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 233 transitions. [2023-08-30 03:13:28,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:28,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:28,306 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:28,307 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 67 flow. Second operand 2 states and 233 transitions. [2023-08-30 03:13:28,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 97 flow [2023-08-30 03:13:28,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 03:13:28,315 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 52 flow [2023-08-30 03:13:28,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2023-08-30 03:13:28,321 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -8 predicate places. [2023-08-30 03:13:28,322 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 52 flow [2023-08-30 03:13:28,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 103.5) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:28,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:28,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 03:13:28,331 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 03:13:28,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:28,529 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:28,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:28,530 INFO L85 PathProgramCache]: Analyzing trace with hash 501832, now seen corresponding path program 1 times [2023-08-30 03:13:28,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:28,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472920954] [2023-08-30 03:13:28,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:28,531 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:28,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:28,533 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:28,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-30 03:13:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:28,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:13:28,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:28,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:28,637 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:28,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:28,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472920954] [2023-08-30 03:13:28,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472920954] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:28,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:28,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:13:28,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230069671] [2023-08-30 03:13:28,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:28,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:13:28,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:28,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:13:28,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:13:28,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 229 [2023-08-30 03:13:28,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:28,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:28,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 229 [2023-08-30 03:13:28,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:28,953 INFO L130 PetriNetUnfolder]: 855/1341 cut-off events. [2023-08-30 03:13:28,953 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:13:28,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2666 conditions, 1341 events. 855/1341 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6255 event pairs, 231 based on Foata normal form. 0/1209 useless extension candidates. Maximal degree in co-relation 2663. Up to 1039 conditions per place. [2023-08-30 03:13:28,959 INFO L137 encePairwiseOnDemand]: 226/229 looper letters, 31 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-08-30 03:13:28,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 154 flow [2023-08-30 03:13:28,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:13:28,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:13:28,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2023-08-30 03:13:28,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4978165938864629 [2023-08-30 03:13:28,966 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 342 transitions. [2023-08-30 03:13:28,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions. [2023-08-30 03:13:28,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:28,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions. [2023-08-30 03:13:28,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:28,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:28,972 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:28,972 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 52 flow. Second operand 3 states and 342 transitions. [2023-08-30 03:13:28,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 154 flow [2023-08-30 03:13:28,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 03:13:28,974 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-08-30 03:13:28,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-08-30 03:13:28,975 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -7 predicate places. [2023-08-30 03:13:28,975 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-08-30 03:13:28,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:28,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:28,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:28,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-30 03:13:29,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:29,187 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:29,190 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:29,190 INFO L85 PathProgramCache]: Analyzing trace with hash -176832908, now seen corresponding path program 1 times [2023-08-30 03:13:29,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:29,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122385462] [2023-08-30 03:13:29,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:29,195 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:29,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:29,196 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:29,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-30 03:13:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:29,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:13:29,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:29,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:29,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:29,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:29,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122385462] [2023-08-30 03:13:29,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122385462] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:29,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:29,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:13:29,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49119748] [2023-08-30 03:13:29,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:29,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:13:29,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:29,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:13:29,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:13:29,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 229 [2023-08-30 03:13:29,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:29,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:29,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 229 [2023-08-30 03:13:29,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:29,549 INFO L130 PetriNetUnfolder]: 494/822 cut-off events. [2023-08-30 03:13:29,549 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2023-08-30 03:13:29,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1750 conditions, 822 events. 494/822 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3792 event pairs, 112 based on Foata normal form. 64/838 useless extension candidates. Maximal degree in co-relation 1746. Up to 401 conditions per place. [2023-08-30 03:13:29,553 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 36 selfloop transitions, 5 changer transitions 1/44 dead transitions. [2023-08-30 03:13:29,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 44 transitions, 190 flow [2023-08-30 03:13:29,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:13:29,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:13:29,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 432 transitions. [2023-08-30 03:13:29,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47161572052401746 [2023-08-30 03:13:29,557 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 432 transitions. [2023-08-30 03:13:29,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 432 transitions. [2023-08-30 03:13:29,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:29,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 432 transitions. [2023-08-30 03:13:29,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.0) internal successors, (432), 4 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 03:13:29,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:29,562 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:29,562 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 4 states and 432 transitions. [2023-08-30 03:13:29,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 44 transitions, 190 flow [2023-08-30 03:13:29,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:13:29,564 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 82 flow [2023-08-30 03:13:29,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2023-08-30 03:13:29,565 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -5 predicate places. [2023-08-30 03:13:29,565 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 82 flow [2023-08-30 03:13:29,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:29,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:29,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:29,575 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 03:13:29,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:29,776 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:29,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:29,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1903610676, now seen corresponding path program 1 times [2023-08-30 03:13:29,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:29,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498264729] [2023-08-30 03:13:29,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:29,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:29,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:29,779 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:29,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-30 03:13:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:29,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:13:29,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:29,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:29,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:29,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:29,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498264729] [2023-08-30 03:13:29,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498264729] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:29,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:29,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:13:29,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759908271] [2023-08-30 03:13:29,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:29,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:13:29,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:29,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:13:29,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:13:29,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 229 [2023-08-30 03:13:29,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:29,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:29,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 229 [2023-08-30 03:13:29,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:30,148 INFO L130 PetriNetUnfolder]: 224/417 cut-off events. [2023-08-30 03:13:30,149 INFO L131 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2023-08-30 03:13:30,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 417 events. 224/417 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1683 event pairs, 56 based on Foata normal form. 37/442 useless extension candidates. Maximal degree in co-relation 1100. Up to 162 conditions per place. [2023-08-30 03:13:30,151 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 44 selfloop transitions, 8 changer transitions 1/55 dead transitions. [2023-08-30 03:13:30,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 55 transitions, 271 flow [2023-08-30 03:13:30,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:13:30,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:13:30,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2023-08-30 03:13:30,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47161572052401746 [2023-08-30 03:13:30,154 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 540 transitions. [2023-08-30 03:13:30,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 540 transitions. [2023-08-30 03:13:30,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:30,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 540 transitions. [2023-08-30 03:13:30,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:30,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:30,159 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:30,159 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 82 flow. Second operand 5 states and 540 transitions. [2023-08-30 03:13:30,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 55 transitions, 271 flow [2023-08-30 03:13:30,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 55 transitions, 261 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 03:13:30,162 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 122 flow [2023-08-30 03:13:30,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2023-08-30 03:13:30,163 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2023-08-30 03:13:30,163 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 122 flow [2023-08-30 03:13:30,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:30,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:30,164 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:30,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-30 03:13:30,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:30,375 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:30,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:30,375 INFO L85 PathProgramCache]: Analyzing trace with hash -65893264, now seen corresponding path program 1 times [2023-08-30 03:13:30,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:30,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128757600] [2023-08-30 03:13:30,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:30,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:30,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:30,378 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:30,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-30 03:13:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:30,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 03:13:30,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:30,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:30,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:30,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:30,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128757600] [2023-08-30 03:13:30,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128757600] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:30,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:30,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:13:30,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959524901] [2023-08-30 03:13:30,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:30,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:13:30,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:30,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:13:30,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:13:30,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 229 [2023-08-30 03:13:30,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 122 flow. Second operand has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:30,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:30,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 229 [2023-08-30 03:13:30,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:30,741 INFO L130 PetriNetUnfolder]: 143/273 cut-off events. [2023-08-30 03:13:30,741 INFO L131 PetriNetUnfolder]: For 240/240 co-relation queries the response was YES. [2023-08-30 03:13:30,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 273 events. 143/273 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 981 event pairs, 56 based on Foata normal form. 10/280 useless extension candidates. Maximal degree in co-relation 803. Up to 108 conditions per place. [2023-08-30 03:13:30,743 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 32 selfloop transitions, 11 changer transitions 1/46 dead transitions. [2023-08-30 03:13:30,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 258 flow [2023-08-30 03:13:30,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:13:30,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:13:30,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 628 transitions. [2023-08-30 03:13:30,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4570596797671033 [2023-08-30 03:13:30,746 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 628 transitions. [2023-08-30 03:13:30,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 628 transitions. [2023-08-30 03:13:30,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:30,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 628 transitions. [2023-08-30 03:13:30,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 104.66666666666667) internal successors, (628), 6 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:30,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 229.0) internal successors, (1603), 7 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:30,751 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 229.0) internal successors, (1603), 7 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:30,751 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 122 flow. Second operand 6 states and 628 transitions. [2023-08-30 03:13:30,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 258 flow [2023-08-30 03:13:30,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 46 transitions, 233 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-30 03:13:30,754 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 136 flow [2023-08-30 03:13:30,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=136, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-08-30 03:13:30,755 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2023-08-30 03:13:30,755 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 136 flow [2023-08-30 03:13:30,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:30,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:30,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:30,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-30 03:13:30,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:30,967 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:30,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:30,967 INFO L85 PathProgramCache]: Analyzing trace with hash -765908020, now seen corresponding path program 1 times [2023-08-30 03:13:30,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:30,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78071638] [2023-08-30 03:13:30,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:30,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:30,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:30,969 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:30,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-30 03:13:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:31,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-30 03:13:31,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:31,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:31,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:31,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:31,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78071638] [2023-08-30 03:13:31,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78071638] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:31,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:31,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 03:13:31,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988841039] [2023-08-30 03:13:31,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:31,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 03:13:31,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:31,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 03:13:31,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-30 03:13:31,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 229 [2023-08-30 03:13:31,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 136 flow. Second operand has 9 states, 9 states have (on average 100.11111111111111) internal successors, (901), 9 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:31,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:31,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 229 [2023-08-30 03:13:31,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:31,796 INFO L130 PetriNetUnfolder]: 188/364 cut-off events. [2023-08-30 03:13:31,797 INFO L131 PetriNetUnfolder]: For 408/408 co-relation queries the response was YES. [2023-08-30 03:13:31,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1095 conditions, 364 events. 188/364 cut-off events. For 408/408 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1410 event pairs, 71 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 1087. Up to 194 conditions per place. [2023-08-30 03:13:31,799 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 49 selfloop transitions, 6 changer transitions 0/56 dead transitions. [2023-08-30 03:13:31,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 404 flow [2023-08-30 03:13:31,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:13:31,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:13:31,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 532 transitions. [2023-08-30 03:13:31,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4646288209606987 [2023-08-30 03:13:31,803 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 532 transitions. [2023-08-30 03:13:31,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 532 transitions. [2023-08-30 03:13:31,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:31,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 532 transitions. [2023-08-30 03:13:31,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:31,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:31,807 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:31,807 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 136 flow. Second operand 5 states and 532 transitions. [2023-08-30 03:13:31,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 404 flow [2023-08-30 03:13:31,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 56 transitions, 275 flow, removed 20 selfloop flow, removed 9 redundant places. [2023-08-30 03:13:31,812 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 110 flow [2023-08-30 03:13:31,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2023-08-30 03:13:31,815 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2023-08-30 03:13:31,815 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 110 flow [2023-08-30 03:13:31,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 100.11111111111111) internal successors, (901), 9 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:31,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:31,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:31,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-30 03:13:32,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:32,026 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:32,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:32,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1975746460, now seen corresponding path program 1 times [2023-08-30 03:13:32,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:32,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748509390] [2023-08-30 03:13:32,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:32,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:32,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:32,029 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:32,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-30 03:13:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:32,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-30 03:13:32,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:32,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 03:13:32,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:32,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:32,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748509390] [2023-08-30 03:13:32,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748509390] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:32,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:32,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:13:32,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900650395] [2023-08-30 03:13:32,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:32,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:13:32,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:32,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:13:32,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:13:32,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 229 [2023-08-30 03:13:32,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:32,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:32,883 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 229 [2023-08-30 03:13:32,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:33,134 INFO L130 PetriNetUnfolder]: 175/332 cut-off events. [2023-08-30 03:13:33,134 INFO L131 PetriNetUnfolder]: For 218/218 co-relation queries the response was YES. [2023-08-30 03:13:33,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 332 events. 175/332 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1299 event pairs, 22 based on Foata normal form. 2/334 useless extension candidates. Maximal degree in co-relation 945. Up to 275 conditions per place. [2023-08-30 03:13:33,136 INFO L137 encePairwiseOnDemand]: 225/229 looper letters, 32 selfloop transitions, 3 changer transitions 2/40 dead transitions. [2023-08-30 03:13:33,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 228 flow [2023-08-30 03:13:33,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:13:33,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:13:33,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2023-08-30 03:13:33,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4043668122270742 [2023-08-30 03:13:33,138 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 463 transitions. [2023-08-30 03:13:33,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 463 transitions. [2023-08-30 03:13:33,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:33,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 463 transitions. [2023-08-30 03:13:33,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 92.6) internal successors, (463), 5 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:33,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:33,142 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:33,142 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 110 flow. Second operand 5 states and 463 transitions. [2023-08-30 03:13:33,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 228 flow [2023-08-30 03:13:33,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:13:33,144 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 110 flow [2023-08-30 03:13:33,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-08-30 03:13:33,145 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2023-08-30 03:13:33,145 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 110 flow [2023-08-30 03:13:33,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:33,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:33,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:33,158 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 (8)] Ended with exit code 0 [2023-08-30 03:13:33,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:33,357 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:33,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:33,357 INFO L85 PathProgramCache]: Analyzing trace with hash -2094004256, now seen corresponding path program 2 times [2023-08-30 03:13:33,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:33,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530193216] [2023-08-30 03:13:33,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 03:13:33,358 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:33,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:33,359 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:33,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-30 03:13:33,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 03:13:33,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:13:33,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-30 03:13:33,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:33,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:33,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:33,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:33,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530193216] [2023-08-30 03:13:33,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530193216] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:33,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:33,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 03:13:33,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190405450] [2023-08-30 03:13:33,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:33,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 03:13:33,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:33,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 03:13:33,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-08-30 03:13:33,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 229 [2023-08-30 03:13:33,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 110 flow. Second operand has 9 states, 9 states have (on average 100.11111111111111) internal successors, (901), 9 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:33,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:33,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 229 [2023-08-30 03:13:33,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:34,082 INFO L130 PetriNetUnfolder]: 196/384 cut-off events. [2023-08-30 03:13:34,082 INFO L131 PetriNetUnfolder]: For 175/175 co-relation queries the response was YES. [2023-08-30 03:13:34,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 384 events. 196/384 cut-off events. For 175/175 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1525 event pairs, 80 based on Foata normal form. 1/385 useless extension candidates. Maximal degree in co-relation 1058. Up to 177 conditions per place. [2023-08-30 03:13:34,084 INFO L137 encePairwiseOnDemand]: 224/229 looper letters, 41 selfloop transitions, 6 changer transitions 7/55 dead transitions. [2023-08-30 03:13:34,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 307 flow [2023-08-30 03:13:34,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:13:34,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:13:34,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 530 transitions. [2023-08-30 03:13:34,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.462882096069869 [2023-08-30 03:13:34,086 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 530 transitions. [2023-08-30 03:13:34,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 530 transitions. [2023-08-30 03:13:34,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:34,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 530 transitions. [2023-08-30 03:13:34,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:34,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:34,090 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:34,090 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 110 flow. Second operand 5 states and 530 transitions. [2023-08-30 03:13:34,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 307 flow [2023-08-30 03:13:34,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 299 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 03:13:34,092 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 126 flow [2023-08-30 03:13:34,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2023-08-30 03:13:34,092 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2023-08-30 03:13:34,093 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 126 flow [2023-08-30 03:13:34,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 100.11111111111111) internal successors, (901), 9 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:34,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:34,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:34,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-30 03:13:34,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:34,308 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:34,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:34,309 INFO L85 PathProgramCache]: Analyzing trace with hash 851390534, now seen corresponding path program 3 times [2023-08-30 03:13:34,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:34,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1770198587] [2023-08-30 03:13:34,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 03:13:34,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:34,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:34,319 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:34,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-30 03:13:34,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 03:13:34,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:13:34,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:13:34,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:34,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:34,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:34,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:34,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1770198587] [2023-08-30 03:13:34,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1770198587] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:34,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:34,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:13:34,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125576698] [2023-08-30 03:13:34,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:34,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:13:34,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:34,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:13:34,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:13:34,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 229 [2023-08-30 03:13:34,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 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 03:13:34,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:34,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 229 [2023-08-30 03:13:34,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:34,584 INFO L130 PetriNetUnfolder]: 316/604 cut-off events. [2023-08-30 03:13:34,584 INFO L131 PetriNetUnfolder]: For 388/392 co-relation queries the response was YES. [2023-08-30 03:13:34,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1791 conditions, 604 events. 316/604 cut-off events. For 388/392 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2832 event pairs, 107 based on Foata normal form. 4/597 useless extension candidates. Maximal degree in co-relation 1784. Up to 334 conditions per place. [2023-08-30 03:13:34,587 INFO L137 encePairwiseOnDemand]: 226/229 looper letters, 35 selfloop transitions, 2 changer transitions 12/51 dead transitions. [2023-08-30 03:13:34,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 51 transitions, 298 flow [2023-08-30 03:13:34,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:13:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:13:34,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2023-08-30 03:13:34,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861717612809316 [2023-08-30 03:13:34,589 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2023-08-30 03:13:34,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2023-08-30 03:13:34,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:34,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2023-08-30 03:13:34,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:34,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:34,592 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:34,592 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 126 flow. Second operand 3 states and 334 transitions. [2023-08-30 03:13:34,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 51 transitions, 298 flow [2023-08-30 03:13:34,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:13:34,595 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 117 flow [2023-08-30 03:13:34,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-30 03:13:34,596 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2023-08-30 03:13:34,596 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 117 flow [2023-08-30 03:13:34,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 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 03:13:34,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:34,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:34,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-30 03:13:34,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:34,807 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:34,807 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:34,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1871080872, now seen corresponding path program 4 times [2023-08-30 03:13:34,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:34,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387213894] [2023-08-30 03:13:34,808 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 03:13:34,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:34,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:34,809 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:34,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 (11)] Waiting until timeout for monitored process [2023-08-30 03:13:34,908 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 03:13:34,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:13:34,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:13:34,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:34,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:34,953 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:34,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:34,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387213894] [2023-08-30 03:13:34,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387213894] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:34,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:34,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:13:34,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92573564] [2023-08-30 03:13:34,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:34,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:13:34,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:34,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:13:34,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:13:34,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 229 [2023-08-30 03:13:34,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:34,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:34,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 229 [2023-08-30 03:13:34,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:35,075 INFO L130 PetriNetUnfolder]: 193/398 cut-off events. [2023-08-30 03:13:35,076 INFO L131 PetriNetUnfolder]: For 251/252 co-relation queries the response was YES. [2023-08-30 03:13:35,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 398 events. 193/398 cut-off events. For 251/252 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1744 event pairs, 61 based on Foata normal form. 2/395 useless extension candidates. Maximal degree in co-relation 1230. Up to 218 conditions per place. [2023-08-30 03:13:35,079 INFO L137 encePairwiseOnDemand]: 225/229 looper letters, 29 selfloop transitions, 3 changer transitions 17/50 dead transitions. [2023-08-30 03:13:35,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 289 flow [2023-08-30 03:13:35,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:13:35,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:13:35,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 428 transitions. [2023-08-30 03:13:35,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4672489082969432 [2023-08-30 03:13:35,084 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 428 transitions. [2023-08-30 03:13:35,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 428 transitions. [2023-08-30 03:13:35,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:35,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 428 transitions. [2023-08-30 03:13:35,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:35,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:35,088 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:35,088 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 117 flow. Second operand 4 states and 428 transitions. [2023-08-30 03:13:35,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 289 flow [2023-08-30 03:13:35,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 270 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-08-30 03:13:35,090 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 101 flow [2023-08-30 03:13:35,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2023-08-30 03:13:35,091 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2023-08-30 03:13:35,091 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 101 flow [2023-08-30 03:13:35,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:35,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:35,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:35,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-30 03:13:35,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:35,302 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:13:35,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:35,302 INFO L85 PathProgramCache]: Analyzing trace with hash -323632070, now seen corresponding path program 5 times [2023-08-30 03:13:35,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:35,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368698458] [2023-08-30 03:13:35,303 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 03:13:35,303 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:35,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:35,304 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:35,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-30 03:13:35,433 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 03:13:35,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 03:13:35,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 03:13:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:13:35,553 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 03:13:35,553 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 03:13:35,554 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-30 03:13:35,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-30 03:13:35,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-30 03:13:35,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-30 03:13:35,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-30 03:13:35,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-30 03:13:35,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-30 03:13:35,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-30 03:13:35,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-30 03:13:35,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-30 03:13:35,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-30 03:13:35,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-30 03:13:35,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-30 03:13:35,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-30 03:13:35,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:35,768 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:35,772 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 03:13:35,772 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 03:13:35,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 03:13:35 BasicIcfg [2023-08-30 03:13:35,836 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 03:13:35,836 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 03:13:35,836 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 03:13:35,836 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 03:13:35,837 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:13:21" (3/4) ... [2023-08-30 03:13:35,839 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 03:13:35,839 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 03:13:35,839 INFO L158 Benchmark]: Toolchain (without parser) took 16193.50ms. Allocated memory was 69.2MB in the beginning and 213.9MB in the end (delta: 144.7MB). Free memory was 36.1MB in the beginning and 116.4MB in the end (delta: -80.2MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. [2023-08-30 03:13:35,840 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 54.5MB. Free memory was 32.0MB in the beginning and 31.9MB in the end (delta: 33.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:13:35,840 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.60ms. Allocated memory is still 69.2MB. Free memory was 36.0MB in the beginning and 45.8MB in the end (delta: -9.9MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2023-08-30 03:13:35,840 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.78ms. Allocated memory is still 69.2MB. Free memory was 45.8MB in the beginning and 43.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:13:35,840 INFO L158 Benchmark]: Boogie Preprocessor took 46.44ms. Allocated memory is still 69.2MB. Free memory was 43.0MB in the beginning and 40.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:13:35,841 INFO L158 Benchmark]: RCFGBuilder took 806.60ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 40.9MB in the beginning and 49.7MB in the end (delta: -8.8MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2023-08-30 03:13:35,841 INFO L158 Benchmark]: TraceAbstraction took 14772.11ms. Allocated memory was 86.0MB in the beginning and 213.9MB in the end (delta: 127.9MB). Free memory was 48.8MB in the beginning and 116.4MB in the end (delta: -67.6MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. [2023-08-30 03:13:35,841 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 213.9MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:13:35,842 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 54.5MB. Free memory was 32.0MB in the beginning and 31.9MB in the end (delta: 33.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 505.60ms. Allocated memory is still 69.2MB. Free memory was 36.0MB in the beginning and 45.8MB in the end (delta: -9.9MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.78ms. Allocated memory is still 69.2MB. Free memory was 45.8MB in the beginning and 43.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.44ms. Allocated memory is still 69.2MB. Free memory was 43.0MB in the beginning and 40.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 806.60ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 40.9MB in the beginning and 49.7MB in the end (delta: -8.8MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * TraceAbstraction took 14772.11ms. Allocated memory was 86.0MB in the beginning and 213.9MB in the end (delta: 127.9MB). Free memory was 48.8MB in the beginning and 116.4MB in the end (delta: -67.6MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 213.9MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3s, 121 PlacesBefore, 39 PlacesAfterwards, 113 TransitionsBefore, 29 TransitionsAfterwards, 2032 CoEnabledTransitionPairs, 6 FixpointIterations, 48 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 113 TotalNumberOfCompositions, 4674 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2359, independent: 2214, independent conditional: 0, independent unconditional: 2214, dependent: 145, dependent conditional: 0, dependent unconditional: 145, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1116, independent: 1075, independent conditional: 0, independent unconditional: 1075, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2359, independent: 1139, independent conditional: 0, independent unconditional: 1139, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 1116, unknown conditional: 0, unknown unconditional: 1116] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 63, Positive conditional cache size: 0, Positive unconditional cache size: 63, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [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$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2177; [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2177, ((void *)0), P0, ((void *)0))=-1, t2177={-6: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L815] 0 pthread_t t2178; [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2178, ((void *)0), P1, ((void *)0))=0, t2177={-6:0}, t2178={-10: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L817] 0 pthread_t t2179; [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2179, ((void *)0), P2, ((void *)0))=1, t2177={-6:0}, t2178={-10:0}, t2179={-2: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 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) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 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_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L785] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 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) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 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 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 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_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={-6:0}, t2178={-10:0}, t2179={-2: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 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) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={-6:0}, t2178={-10:0}, t2179={-2: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 818]: 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: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 142 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 452 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 357 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 127 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1120 IncrementalHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 29 mSDtfsCounter, 1120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=5, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 131 ConstructedInterpolants, 17 QuantifiedInterpolants, 1451 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1260 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 03:13:35,872 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