./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.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/mix047_power.oepc_pso.oepc_rmo.oepc.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 dcc3fad0768415d67ba0b5226238487b935d262c55e83ab1790d239680fbb73d --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:56:36,643 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:56:36,646 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:56:36,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:56:36,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:56:36,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:56:36,694 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:56:36,696 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:56:36,698 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:56:36,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:56:36,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:56:36,706 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:56:36,706 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:56:36,708 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:56:36,709 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:56:36,714 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:56:36,715 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:56:36,718 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:56:36,722 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:56:36,726 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:56:36,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:56:36,734 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:56:36,735 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:56:36,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:56:36,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:56:36,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:56:36,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:56:36,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:56:36,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:56:36,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:56:36,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:56:36,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:56:36,751 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:56:36,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:56:36,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:56:36,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:56:36,753 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:56:36,753 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:56:36,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:56:36,754 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:56:36,755 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:56:36,756 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 02:56:36,788 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:56:36,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:56:36,790 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:56:36,790 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:56:36,791 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:56:36,791 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:56:36,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:56:36,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:56:36,792 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:56:36,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:56:36,793 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:56:36,793 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:56:36,794 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:56:36,794 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:56:36,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:56:36,794 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:56:36,794 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:56:36,795 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:56:36,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:56:36,795 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:56:36,795 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:56:36,795 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:56:36,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:56:36,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:56:36,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:56:36,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:56:36,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:56:36,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:56:36,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:56:36,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:56:36,797 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:56:36,797 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:56:36,798 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:56:36,798 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:56:36,798 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 -> dcc3fad0768415d67ba0b5226238487b935d262c55e83ab1790d239680fbb73d Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 02:56:37,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:56:37,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:56:37,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:56:37,126 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:56:37,126 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:56:37,127 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 02:56:38,333 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:56:38,656 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:56:38,657 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 02:56:38,677 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39ccdb81a/4e96ad9c9633489cb008ab694cae57d3/FLAGce9d07fec [2023-08-30 02:56:38,697 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39ccdb81a/4e96ad9c9633489cb008ab694cae57d3 [2023-08-30 02:56:38,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:56:38,701 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:56:38,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:56:38,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:56:38,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:56:38,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:56:38" (1/1) ... [2023-08-30 02:56:38,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a0c1415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:38, skipping insertion in model container [2023-08-30 02:56:38,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:56:38" (1/1) ... [2023-08-30 02:56:38,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:56:38,774 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:56:38,947 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/mix047_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-30 02:56:39,154 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:56:39,166 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:56:39,184 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/mix047_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-30 02:56:39,219 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:56:39,249 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:56:39,249 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:56:39,255 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:56:39,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:39 WrapperNode [2023-08-30 02:56:39,256 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:56:39,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:56:39,257 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:56:39,257 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:56:39,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:39" (1/1) ... [2023-08-30 02:56:39,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:39" (1/1) ... [2023-08-30 02:56:39,340 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-08-30 02:56:39,340 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:56:39,341 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:56:39,341 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:56:39,341 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:56:39,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:39" (1/1) ... [2023-08-30 02:56:39,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:39" (1/1) ... [2023-08-30 02:56:39,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:39" (1/1) ... [2023-08-30 02:56:39,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:39" (1/1) ... [2023-08-30 02:56:39,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:39" (1/1) ... [2023-08-30 02:56:39,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:39" (1/1) ... [2023-08-30 02:56:39,389 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:39" (1/1) ... [2023-08-30 02:56:39,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:39" (1/1) ... [2023-08-30 02:56:39,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:56:39,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:56:39,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:56:39,402 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:56:39,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:39" (1/1) ... [2023-08-30 02:56:39,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:56:39,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:56:39,438 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 02:56:39,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 02:56:39,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:56:39,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:56:39,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:56:39,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:56:39,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:56:39,470 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:56:39,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:56:39,470 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:56:39,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:56:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:56:39,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:56:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:56:39,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:56:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:56:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:56:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:56:39,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:56:39,473 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:56:39,661 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:56:39,663 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:56:40,061 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:56:40,195 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:56:40,195 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:56:40,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:56:40 BoogieIcfgContainer [2023-08-30 02:56:40,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:56:40,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:56:40,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:56:40,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:56:40,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:56:38" (1/3) ... [2023-08-30 02:56:40,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739e3955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:56:40, skipping insertion in model container [2023-08-30 02:56:40,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:39" (2/3) ... [2023-08-30 02:56:40,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739e3955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:56:40, skipping insertion in model container [2023-08-30 02:56:40,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:56:40" (3/3) ... [2023-08-30 02:56:40,204 INFO L112 eAbstractionObserver]: Analyzing ICFG mix047_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 02:56:40,218 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:56:40,218 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:56:40,218 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:56:40,284 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:56:40,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 143 transitions, 306 flow [2023-08-30 02:56:40,363 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-30 02:56:40,364 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:56:40,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-30 02:56:40,368 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 143 transitions, 306 flow [2023-08-30 02:56:40,373 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 139 transitions, 290 flow [2023-08-30 02:56:40,379 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:56:40,390 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-30 02:56:40,393 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-30 02:56:40,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 290 flow [2023-08-30 02:56:40,432 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-30 02:56:40,432 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:56:40,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-30 02:56:40,436 INFO L119 LiptonReduction]: Number of co-enabled transitions 3636 [2023-08-30 02:56:44,842 INFO L134 LiptonReduction]: Checked pairs total: 10303 [2023-08-30 02:56:44,843 INFO L136 LiptonReduction]: Total number of compositions: 132 [2023-08-30 02:56:44,857 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:56:44,863 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;@71c9aa9e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:56:44,864 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:56:44,865 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:56:44,866 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:56:44,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:44,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:56:44,867 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:44,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:44,872 INFO L85 PathProgramCache]: Analyzing trace with hash 606, now seen corresponding path program 1 times [2023-08-30 02:56:44,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:56:44,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787613681] [2023-08-30 02:56:44,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:44,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:56:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:56:44,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:56:44,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:56:44,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787613681] [2023-08-30 02:56:44,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787613681] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:44,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:44,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:56:44,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314138099] [2023-08-30 02:56:44,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:45,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:56:45,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:56:45,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:56:45,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:56:45,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 275 [2023-08-30 02:56:45,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:45,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:45,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 275 [2023-08-30 02:56:45,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:46,842 INFO L130 PetriNetUnfolder]: 10487/14098 cut-off events. [2023-08-30 02:56:46,843 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2023-08-30 02:56:46,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28374 conditions, 14098 events. 10487/14098 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 72311 event pairs, 10487 based on Foata normal form. 0/12404 useless extension candidates. Maximal degree in co-relation 28362. Up to 14059 conditions per place. [2023-08-30 02:56:46,944 INFO L137 encePairwiseOnDemand]: 266/275 looper letters, 29 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-08-30 02:56:46,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 134 flow [2023-08-30 02:56:46,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:56:46,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:56:46,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 294 transitions. [2023-08-30 02:56:46,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5345454545454545 [2023-08-30 02:56:46,963 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 294 transitions. [2023-08-30 02:56:46,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 294 transitions. [2023-08-30 02:56:46,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:46,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 294 transitions. [2023-08-30 02:56:46,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 147.0) internal successors, (294), 2 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:46,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:46,980 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:46,982 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 294 transitions. [2023-08-30 02:56:46,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 134 flow [2023-08-30 02:56:46,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:56:46,988 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-08-30 02:56:46,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-30 02:56:46,993 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-30 02:56:46,993 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-08-30 02:56:46,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:46,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:46,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:56:46,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:56:46,994 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:46,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:46,995 INFO L85 PathProgramCache]: Analyzing trace with hash 594535, now seen corresponding path program 1 times [2023-08-30 02:56:46,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:56:46,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767662924] [2023-08-30 02:56:46,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:46,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:56:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:56:47,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 02:56:47,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:56:47,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767662924] [2023-08-30 02:56:47,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767662924] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:47,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:47,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:56:47,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712664253] [2023-08-30 02:56:47,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:47,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:56:47,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:56:47,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:56:47,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:56:47,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 275 [2023-08-30 02:56:47,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 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 02:56:47,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:47,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 275 [2023-08-30 02:56:47,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:48,543 INFO L130 PetriNetUnfolder]: 8247/11826 cut-off events. [2023-08-30 02:56:48,544 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:56:48,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23103 conditions, 11826 events. 8247/11826 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 71910 event pairs, 1527 based on Foata normal form. 0/11054 useless extension candidates. Maximal degree in co-relation 23100. Up to 8863 conditions per place. [2023-08-30 02:56:48,622 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 47 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2023-08-30 02:56:48,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 224 flow [2023-08-30 02:56:48,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:56:48,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:56:48,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-08-30 02:56:48,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5248484848484849 [2023-08-30 02:56:48,627 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-08-30 02:56:48,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-08-30 02:56:48,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:48,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-08-30 02:56:48,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:48,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:48,631 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:48,631 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 433 transitions. [2023-08-30 02:56:48,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 224 flow [2023-08-30 02:56:48,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 224 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:56:48,633 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-08-30 02:56:48,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-30 02:56:48,634 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-08-30 02:56:48,634 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-08-30 02:56:48,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 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 02:56:48,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:48,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:48,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:56:48,635 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:48,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:48,636 INFO L85 PathProgramCache]: Analyzing trace with hash 96021108, now seen corresponding path program 1 times [2023-08-30 02:56:48,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:56:48,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146205684] [2023-08-30 02:56:48,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:48,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:56:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:56:49,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:56:49,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:56:49,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146205684] [2023-08-30 02:56:49,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146205684] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:49,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:49,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:56:49,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230394967] [2023-08-30 02:56:49,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:49,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:56:49,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:56:49,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:56:49,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:56:49,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 275 [2023-08-30 02:56:49,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:49,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:49,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 275 [2023-08-30 02:56:49,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:52,239 INFO L130 PetriNetUnfolder]: 30353/40356 cut-off events. [2023-08-30 02:56:52,240 INFO L131 PetriNetUnfolder]: For 1898/1898 co-relation queries the response was YES. [2023-08-30 02:56:52,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83012 conditions, 40356 events. 30353/40356 cut-off events. For 1898/1898 co-relation queries the response was YES. Maximal size of possible extension queue 1245. Compared 216413 event pairs, 8056 based on Foata normal form. 0/38987 useless extension candidates. Maximal degree in co-relation 83008. Up to 14653 conditions per place. [2023-08-30 02:56:52,487 INFO L137 encePairwiseOnDemand]: 263/275 looper letters, 72 selfloop transitions, 20 changer transitions 0/92 dead transitions. [2023-08-30 02:56:52,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 92 transitions, 390 flow [2023-08-30 02:56:52,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:56:52,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:56:52,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2023-08-30 02:56:52,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48654545454545456 [2023-08-30 02:56:52,490 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2023-08-30 02:56:52,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2023-08-30 02:56:52,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:52,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2023-08-30 02:56:52,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:52,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:52,495 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:52,495 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 5 states and 669 transitions. [2023-08-30 02:56:52,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 92 transitions, 390 flow [2023-08-30 02:56:52,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 92 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:56:52,498 INFO L231 Difference]: Finished difference. Result has 48 places, 49 transitions, 228 flow [2023-08-30 02:56:52,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=228, PETRI_PLACES=48, PETRI_TRANSITIONS=49} [2023-08-30 02:56:52,499 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2023-08-30 02:56:52,500 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 49 transitions, 228 flow [2023-08-30 02:56:52,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:52,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:52,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:52,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:56:52,501 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:52,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:52,501 INFO L85 PathProgramCache]: Analyzing trace with hash 96021152, now seen corresponding path program 1 times [2023-08-30 02:56:52,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:56:52,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019754372] [2023-08-30 02:56:52,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:52,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:56:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:56:53,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:56:53,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:56:53,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019754372] [2023-08-30 02:56:53,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019754372] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:53,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:53,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:56:53,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017586475] [2023-08-30 02:56:53,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:53,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:56:53,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:56:53,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:56:53,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:56:53,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 275 [2023-08-30 02:56:53,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 49 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 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 02:56:53,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:53,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 275 [2023-08-30 02:56:53,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:55,642 INFO L130 PetriNetUnfolder]: 21039/29065 cut-off events. [2023-08-30 02:56:55,643 INFO L131 PetriNetUnfolder]: For 26407/26955 co-relation queries the response was YES. [2023-08-30 02:56:55,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80070 conditions, 29065 events. 21039/29065 cut-off events. For 26407/26955 co-relation queries the response was YES. Maximal size of possible extension queue 1257. Compared 171698 event pairs, 5271 based on Foata normal form. 2856/31145 useless extension candidates. Maximal degree in co-relation 80063. Up to 26845 conditions per place. [2023-08-30 02:56:55,829 INFO L137 encePairwiseOnDemand]: 270/275 looper letters, 53 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2023-08-30 02:56:55,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 66 transitions, 384 flow [2023-08-30 02:56:55,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:56:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:56:55,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 699 transitions. [2023-08-30 02:56:55,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42363636363636364 [2023-08-30 02:56:55,833 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 699 transitions. [2023-08-30 02:56:55,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 699 transitions. [2023-08-30 02:56:55,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:55,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 699 transitions. [2023-08-30 02:56:55,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:55,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:55,839 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:55,839 INFO L175 Difference]: Start difference. First operand has 48 places, 49 transitions, 228 flow. Second operand 6 states and 699 transitions. [2023-08-30 02:56:55,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 66 transitions, 384 flow [2023-08-30 02:56:55,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 66 transitions, 384 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:56:55,850 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 218 flow [2023-08-30 02:56:55,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2023-08-30 02:56:55,852 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2023-08-30 02:56:55,852 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 218 flow [2023-08-30 02:56:55,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 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 02:56:55,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:55,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:55,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:56:55,853 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:55,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:55,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1810184887, now seen corresponding path program 1 times [2023-08-30 02:56:55,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:56:55,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772472012] [2023-08-30 02:56:55,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:55,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:56:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:56:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:56:56,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:56:56,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772472012] [2023-08-30 02:56:56,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772472012] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:56,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:56,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:56:56,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107909947] [2023-08-30 02:56:56,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:56,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:56:56,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:56:56,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:56:56,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:56:56,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 275 [2023-08-30 02:56:56,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:56,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:56,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 275 [2023-08-30 02:56:56,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:59,314 INFO L130 PetriNetUnfolder]: 25275/34471 cut-off events. [2023-08-30 02:56:59,314 INFO L131 PetriNetUnfolder]: For 30554/30554 co-relation queries the response was YES. [2023-08-30 02:56:59,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98738 conditions, 34471 events. 25275/34471 cut-off events. For 30554/30554 co-relation queries the response was YES. Maximal size of possible extension queue 1138. Compared 190526 event pairs, 3880 based on Foata normal form. 1369/35840 useless extension candidates. Maximal degree in co-relation 98730. Up to 10527 conditions per place. [2023-08-30 02:56:59,499 INFO L137 encePairwiseOnDemand]: 265/275 looper letters, 59 selfloop transitions, 9 changer transitions 67/135 dead transitions. [2023-08-30 02:56:59,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 135 transitions, 840 flow [2023-08-30 02:56:59,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:56:59,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:56:59,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 915 transitions. [2023-08-30 02:56:59,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4753246753246753 [2023-08-30 02:56:59,502 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 915 transitions. [2023-08-30 02:56:59,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 915 transitions. [2023-08-30 02:56:59,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:59,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 915 transitions. [2023-08-30 02:56:59,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.71428571428572) internal successors, (915), 7 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:59,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:59,509 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:59,509 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 218 flow. Second operand 7 states and 915 transitions. [2023-08-30 02:56:59,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 135 transitions, 840 flow [2023-08-30 02:56:59,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 135 transitions, 833 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:56:59,520 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 251 flow [2023-08-30 02:56:59,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=251, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2023-08-30 02:56:59,521 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2023-08-30 02:56:59,521 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 251 flow [2023-08-30 02:56:59,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:59,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:59,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:59,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:56:59,522 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:59,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:59,523 INFO L85 PathProgramCache]: Analyzing trace with hash 2020112961, now seen corresponding path program 1 times [2023-08-30 02:56:59,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:56:59,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508094108] [2023-08-30 02:56:59,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:59,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:56:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:56:59,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:56:59,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:56:59,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508094108] [2023-08-30 02:56:59,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508094108] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:59,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:59,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:56:59,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126852160] [2023-08-30 02:56:59,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:59,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:56:59,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:56:59,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:56:59,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:56:59,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 275 [2023-08-30 02:56:59,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 42 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:59,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:59,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 275 [2023-08-30 02:56:59,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:02,170 INFO L130 PetriNetUnfolder]: 19711/26881 cut-off events. [2023-08-30 02:57:02,170 INFO L131 PetriNetUnfolder]: For 63554/63554 co-relation queries the response was YES. [2023-08-30 02:57:02,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88187 conditions, 26881 events. 19711/26881 cut-off events. For 63554/63554 co-relation queries the response was YES. Maximal size of possible extension queue 836. Compared 145646 event pairs, 2055 based on Foata normal form. 893/27774 useless extension candidates. Maximal degree in co-relation 88174. Up to 11748 conditions per place. [2023-08-30 02:57:02,317 INFO L137 encePairwiseOnDemand]: 264/275 looper letters, 65 selfloop transitions, 20 changer transitions 45/130 dead transitions. [2023-08-30 02:57:02,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 130 transitions, 953 flow [2023-08-30 02:57:02,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:57:02,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:57:02,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 918 transitions. [2023-08-30 02:57:02,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4768831168831169 [2023-08-30 02:57:02,320 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 918 transitions. [2023-08-30 02:57:02,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 918 transitions. [2023-08-30 02:57:02,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:02,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 918 transitions. [2023-08-30 02:57:02,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.14285714285714) internal successors, (918), 7 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:02,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:02,327 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:02,327 INFO L175 Difference]: Start difference. First operand has 60 places, 42 transitions, 251 flow. Second operand 7 states and 918 transitions. [2023-08-30 02:57:02,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 130 transitions, 953 flow [2023-08-30 02:57:02,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 130 transitions, 864 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-30 02:57:02,475 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 425 flow [2023-08-30 02:57:02,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=425, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2023-08-30 02:57:02,476 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 10 predicate places. [2023-08-30 02:57:02,476 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 425 flow [2023-08-30 02:57:02,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:02,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:02,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:02,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:57:02,477 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:02,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:02,478 INFO L85 PathProgramCache]: Analyzing trace with hash 133099089, now seen corresponding path program 1 times [2023-08-30 02:57:02,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:57:02,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257733270] [2023-08-30 02:57:02,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:02,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:57:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:02,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:57:02,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257733270] [2023-08-30 02:57:02,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257733270] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:02,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:02,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:57:02,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255132573] [2023-08-30 02:57:02,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:02,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:57:02,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:57:02,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:57:02,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:57:02,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 275 [2023-08-30 02:57:02,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 425 flow. Second operand has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:02,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:02,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 275 [2023-08-30 02:57:02,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:04,589 INFO L130 PetriNetUnfolder]: 16273/22974 cut-off events. [2023-08-30 02:57:04,589 INFO L131 PetriNetUnfolder]: For 67095/67755 co-relation queries the response was YES. [2023-08-30 02:57:04,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78194 conditions, 22974 events. 16273/22974 cut-off events. For 67095/67755 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 132373 event pairs, 7148 based on Foata normal form. 1088/24034 useless extension candidates. Maximal degree in co-relation 78177. Up to 19127 conditions per place. [2023-08-30 02:57:04,757 INFO L137 encePairwiseOnDemand]: 270/275 looper letters, 67 selfloop transitions, 10 changer transitions 27/113 dead transitions. [2023-08-30 02:57:04,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 113 transitions, 982 flow [2023-08-30 02:57:04,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:57:04,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:57:04,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 689 transitions. [2023-08-30 02:57:04,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5010909090909091 [2023-08-30 02:57:04,760 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 689 transitions. [2023-08-30 02:57:04,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 689 transitions. [2023-08-30 02:57:04,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:04,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 689 transitions. [2023-08-30 02:57:04,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.8) internal successors, (689), 5 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:04,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:04,765 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:04,765 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 425 flow. Second operand 5 states and 689 transitions. [2023-08-30 02:57:04,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 113 transitions, 982 flow [2023-08-30 02:57:04,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 113 transitions, 950 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-08-30 02:57:04,967 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 549 flow [2023-08-30 02:57:04,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=549, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2023-08-30 02:57:04,968 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2023-08-30 02:57:04,968 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 549 flow [2023-08-30 02:57:04,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:04,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:04,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:04,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:57:04,969 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:04,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:04,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1459604967, now seen corresponding path program 1 times [2023-08-30 02:57:04,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:57:04,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861681053] [2023-08-30 02:57:04,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:04,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:57:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:05,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:05,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:57:05,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861681053] [2023-08-30 02:57:05,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861681053] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:05,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:05,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:57:05,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200013833] [2023-08-30 02:57:05,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:05,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:57:05,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:57:05,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:57:05,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:57:05,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 275 [2023-08-30 02:57:05,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 549 flow. Second operand has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:05,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:05,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 275 [2023-08-30 02:57:05,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:08,468 INFO L130 PetriNetUnfolder]: 26100/35784 cut-off events. [2023-08-30 02:57:08,468 INFO L131 PetriNetUnfolder]: For 114069/114069 co-relation queries the response was YES. [2023-08-30 02:57:08,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124512 conditions, 35784 events. 26100/35784 cut-off events. For 114069/114069 co-relation queries the response was YES. Maximal size of possible extension queue 1092. Compared 204986 event pairs, 4328 based on Foata normal form. 963/36747 useless extension candidates. Maximal degree in co-relation 124493. Up to 13446 conditions per place. [2023-08-30 02:57:08,855 INFO L137 encePairwiseOnDemand]: 264/275 looper letters, 71 selfloop transitions, 34 changer transitions 44/149 dead transitions. [2023-08-30 02:57:08,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 149 transitions, 1263 flow [2023-08-30 02:57:08,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:57:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:57:08,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 921 transitions. [2023-08-30 02:57:08,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47844155844155845 [2023-08-30 02:57:08,858 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 921 transitions. [2023-08-30 02:57:08,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 921 transitions. [2023-08-30 02:57:08,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:08,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 921 transitions. [2023-08-30 02:57:08,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.57142857142858) internal successors, (921), 7 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:08,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:08,864 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:08,864 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 549 flow. Second operand 7 states and 921 transitions. [2023-08-30 02:57:08,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 149 transitions, 1263 flow [2023-08-30 02:57:09,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 149 transitions, 1233 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-08-30 02:57:09,104 INFO L231 Difference]: Finished difference. Result has 71 places, 69 transitions, 748 flow [2023-08-30 02:57:09,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=748, PETRI_PLACES=71, PETRI_TRANSITIONS=69} [2023-08-30 02:57:09,105 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 18 predicate places. [2023-08-30 02:57:09,105 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 748 flow [2023-08-30 02:57:09,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:09,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:09,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:09,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:57:09,106 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:09,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:09,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1434789064, now seen corresponding path program 1 times [2023-08-30 02:57:09,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:57:09,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318846208] [2023-08-30 02:57:09,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:09,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:57:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:09,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:09,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:57:09,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318846208] [2023-08-30 02:57:09,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318846208] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:09,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:09,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:57:09,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882477202] [2023-08-30 02:57:09,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:09,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:57:09,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:57:09,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:57:09,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:57:09,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 275 [2023-08-30 02:57:09,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 69 transitions, 748 flow. Second operand has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:09,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:09,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 275 [2023-08-30 02:57:09,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:11,733 INFO L130 PetriNetUnfolder]: 15195/22389 cut-off events. [2023-08-30 02:57:11,734 INFO L131 PetriNetUnfolder]: For 99309/101459 co-relation queries the response was YES. [2023-08-30 02:57:11,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78224 conditions, 22389 events. 15195/22389 cut-off events. For 99309/101459 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 146258 event pairs, 2587 based on Foata normal form. 2401/24657 useless extension candidates. Maximal degree in co-relation 78203. Up to 14424 conditions per place. [2023-08-30 02:57:11,878 INFO L137 encePairwiseOnDemand]: 268/275 looper letters, 151 selfloop transitions, 10 changer transitions 0/182 dead transitions. [2023-08-30 02:57:11,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 182 transitions, 2173 flow [2023-08-30 02:57:11,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:57:11,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:57:11,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 687 transitions. [2023-08-30 02:57:11,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49963636363636366 [2023-08-30 02:57:11,880 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 687 transitions. [2023-08-30 02:57:11,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 687 transitions. [2023-08-30 02:57:11,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:11,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 687 transitions. [2023-08-30 02:57:11,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.4) internal successors, (687), 5 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 02:57:11,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:11,885 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:11,885 INFO L175 Difference]: Start difference. First operand has 71 places, 69 transitions, 748 flow. Second operand 5 states and 687 transitions. [2023-08-30 02:57:11,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 182 transitions, 2173 flow [2023-08-30 02:57:11,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 182 transitions, 2157 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-30 02:57:11,946 INFO L231 Difference]: Finished difference. Result has 73 places, 78 transitions, 813 flow [2023-08-30 02:57:11,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=813, PETRI_PLACES=73, PETRI_TRANSITIONS=78} [2023-08-30 02:57:11,947 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 20 predicate places. [2023-08-30 02:57:11,947 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 78 transitions, 813 flow [2023-08-30 02:57:11,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:11,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:11,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:11,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:57:11,948 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:11,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:11,949 INFO L85 PathProgramCache]: Analyzing trace with hash 145291351, now seen corresponding path program 1 times [2023-08-30 02:57:11,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:57:11,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877789378] [2023-08-30 02:57:11,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:11,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:57:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:12,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:12,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:57:12,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877789378] [2023-08-30 02:57:12,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877789378] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:12,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:12,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:57:12,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841870114] [2023-08-30 02:57:12,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:12,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:57:12,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:57:12,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:57:12,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:57:12,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 275 [2023-08-30 02:57:12,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 78 transitions, 813 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:12,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:12,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 275 [2023-08-30 02:57:12,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:16,337 INFO L130 PetriNetUnfolder]: 28447/40984 cut-off events. [2023-08-30 02:57:16,337 INFO L131 PetriNetUnfolder]: For 200569/200569 co-relation queries the response was YES. [2023-08-30 02:57:16,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177635 conditions, 40984 events. 28447/40984 cut-off events. For 200569/200569 co-relation queries the response was YES. Maximal size of possible extension queue 1436. Compared 268979 event pairs, 7517 based on Foata normal form. 612/41596 useless extension candidates. Maximal degree in co-relation 177612. Up to 16904 conditions per place. [2023-08-30 02:57:16,626 INFO L137 encePairwiseOnDemand]: 264/275 looper letters, 90 selfloop transitions, 33 changer transitions 72/195 dead transitions. [2023-08-30 02:57:16,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 195 transitions, 2078 flow [2023-08-30 02:57:16,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:57:16,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:57:16,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 920 transitions. [2023-08-30 02:57:16,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4779220779220779 [2023-08-30 02:57:16,629 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 920 transitions. [2023-08-30 02:57:16,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 920 transitions. [2023-08-30 02:57:16,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:16,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 920 transitions. [2023-08-30 02:57:16,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.42857142857142) internal successors, (920), 7 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:16,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:16,635 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:16,635 INFO L175 Difference]: Start difference. First operand has 73 places, 78 transitions, 813 flow. Second operand 7 states and 920 transitions. [2023-08-30 02:57:16,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 195 transitions, 2078 flow [2023-08-30 02:57:16,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 195 transitions, 2057 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-30 02:57:16,958 INFO L231 Difference]: Finished difference. Result has 84 places, 77 transitions, 997 flow [2023-08-30 02:57:16,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=997, PETRI_PLACES=84, PETRI_TRANSITIONS=77} [2023-08-30 02:57:16,959 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 31 predicate places. [2023-08-30 02:57:16,959 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 77 transitions, 997 flow [2023-08-30 02:57:16,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:16,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:16,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:16,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:57:16,960 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:16,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:16,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2093348654, now seen corresponding path program 1 times [2023-08-30 02:57:16,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:57:16,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984645656] [2023-08-30 02:57:16,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:16,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:57:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:17,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:17,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:57:17,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984645656] [2023-08-30 02:57:17,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984645656] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:17,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:17,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:57:17,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075398223] [2023-08-30 02:57:17,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:17,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:57:17,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:57:17,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:57:17,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:57:17,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 275 [2023-08-30 02:57:17,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 77 transitions, 997 flow. Second operand has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 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 02:57:17,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:17,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 275 [2023-08-30 02:57:17,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:19,207 INFO L130 PetriNetUnfolder]: 10747/16719 cut-off events. [2023-08-30 02:57:19,207 INFO L131 PetriNetUnfolder]: For 93786/95067 co-relation queries the response was YES. [2023-08-30 02:57:19,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68589 conditions, 16719 events. 10747/16719 cut-off events. For 93786/95067 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 115127 event pairs, 1480 based on Foata normal form. 1963/18529 useless extension candidates. Maximal degree in co-relation 68561. Up to 6350 conditions per place. [2023-08-30 02:57:19,291 INFO L137 encePairwiseOnDemand]: 268/275 looper letters, 179 selfloop transitions, 14 changer transitions 16/228 dead transitions. [2023-08-30 02:57:19,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 228 transitions, 3245 flow [2023-08-30 02:57:19,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:57:19,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:57:19,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 827 transitions. [2023-08-30 02:57:19,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5012121212121212 [2023-08-30 02:57:19,294 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 827 transitions. [2023-08-30 02:57:19,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 827 transitions. [2023-08-30 02:57:19,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:19,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 827 transitions. [2023-08-30 02:57:19,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.83333333333334) internal successors, (827), 6 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:19,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:19,299 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:19,299 INFO L175 Difference]: Start difference. First operand has 84 places, 77 transitions, 997 flow. Second operand 6 states and 827 transitions. [2023-08-30 02:57:19,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 228 transitions, 3245 flow [2023-08-30 02:57:19,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 228 transitions, 3201 flow, removed 22 selfloop flow, removed 2 redundant places. [2023-08-30 02:57:19,474 INFO L231 Difference]: Finished difference. Result has 85 places, 86 transitions, 1101 flow [2023-08-30 02:57:19,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=981, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1101, PETRI_PLACES=85, PETRI_TRANSITIONS=86} [2023-08-30 02:57:19,475 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 32 predicate places. [2023-08-30 02:57:19,475 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 86 transitions, 1101 flow [2023-08-30 02:57:19,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 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 02:57:19,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:19,476 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:19,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 02:57:19,476 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:19,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:19,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1482428367, now seen corresponding path program 1 times [2023-08-30 02:57:19,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:57:19,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832265188] [2023-08-30 02:57:19,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:19,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:57:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:19,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:19,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:57:19,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832265188] [2023-08-30 02:57:19,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832265188] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:19,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:19,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:57:19,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676449740] [2023-08-30 02:57:19,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:19,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:57:19,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:57:19,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:57:19,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:57:19,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 275 [2023-08-30 02:57:19,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 86 transitions, 1101 flow. Second operand has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 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 02:57:19,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:19,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 275 [2023-08-30 02:57:19,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:22,781 INFO L130 PetriNetUnfolder]: 18675/28458 cut-off events. [2023-08-30 02:57:22,781 INFO L131 PetriNetUnfolder]: For 199274/199274 co-relation queries the response was YES. [2023-08-30 02:57:22,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140820 conditions, 28458 events. 18675/28458 cut-off events. For 199274/199274 co-relation queries the response was YES. Maximal size of possible extension queue 1227. Compared 197440 event pairs, 3467 based on Foata normal form. 150/28608 useless extension candidates. Maximal degree in co-relation 140790. Up to 14028 conditions per place. [2023-08-30 02:57:22,993 INFO L137 encePairwiseOnDemand]: 264/275 looper letters, 88 selfloop transitions, 36 changer transitions 57/181 dead transitions. [2023-08-30 02:57:22,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 181 transitions, 2384 flow [2023-08-30 02:57:22,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:57:22,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:57:22,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2023-08-30 02:57:22,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48145454545454547 [2023-08-30 02:57:22,995 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2023-08-30 02:57:22,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2023-08-30 02:57:22,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:22,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2023-08-30 02:57:22,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:22,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:22,999 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:22,999 INFO L175 Difference]: Start difference. First operand has 85 places, 86 transitions, 1101 flow. Second operand 5 states and 662 transitions. [2023-08-30 02:57:22,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 181 transitions, 2384 flow [2023-08-30 02:57:24,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 181 transitions, 2244 flow, removed 57 selfloop flow, removed 4 redundant places. [2023-08-30 02:57:24,797 INFO L231 Difference]: Finished difference. Result has 88 places, 77 transitions, 1037 flow [2023-08-30 02:57:24,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1037, PETRI_PLACES=88, PETRI_TRANSITIONS=77} [2023-08-30 02:57:24,798 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 35 predicate places. [2023-08-30 02:57:24,798 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 77 transitions, 1037 flow [2023-08-30 02:57:24,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 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 02:57:24,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:24,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:24,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 02:57:24,799 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:24,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:24,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1854297175, now seen corresponding path program 2 times [2023-08-30 02:57:24,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:57:24,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911291391] [2023-08-30 02:57:24,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:24,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:57:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:25,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:25,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:57:25,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911291391] [2023-08-30 02:57:25,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911291391] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:25,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:25,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:57:25,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659877824] [2023-08-30 02:57:25,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:25,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:57:25,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:57:25,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:57:25,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:57:25,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 275 [2023-08-30 02:57:25,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 77 transitions, 1037 flow. Second operand has 6 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:25,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:25,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 275 [2023-08-30 02:57:25,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:26,277 INFO L130 PetriNetUnfolder]: 6480/10716 cut-off events. [2023-08-30 02:57:26,277 INFO L131 PetriNetUnfolder]: For 53807/54234 co-relation queries the response was YES. [2023-08-30 02:57:26,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44008 conditions, 10716 events. 6480/10716 cut-off events. For 53807/54234 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 76043 event pairs, 1151 based on Foata normal form. 845/11413 useless extension candidates. Maximal degree in co-relation 43977. Up to 3458 conditions per place. [2023-08-30 02:57:26,350 INFO L137 encePairwiseOnDemand]: 268/275 looper letters, 126 selfloop transitions, 13 changer transitions 71/225 dead transitions. [2023-08-30 02:57:26,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 225 transitions, 3292 flow [2023-08-30 02:57:26,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:57:26,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:57:26,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 965 transitions. [2023-08-30 02:57:26,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5012987012987012 [2023-08-30 02:57:26,352 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 965 transitions. [2023-08-30 02:57:26,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 965 transitions. [2023-08-30 02:57:26,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:26,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 965 transitions. [2023-08-30 02:57:26,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 137.85714285714286) internal successors, (965), 7 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:26,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:26,358 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:26,358 INFO L175 Difference]: Start difference. First operand has 88 places, 77 transitions, 1037 flow. Second operand 7 states and 965 transitions. [2023-08-30 02:57:26,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 225 transitions, 3292 flow [2023-08-30 02:57:26,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 225 transitions, 3153 flow, removed 22 selfloop flow, removed 4 redundant places. [2023-08-30 02:57:26,428 INFO L231 Difference]: Finished difference. Result has 90 places, 76 transitions, 990 flow [2023-08-30 02:57:26,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=990, PETRI_PLACES=90, PETRI_TRANSITIONS=76} [2023-08-30 02:57:26,430 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 37 predicate places. [2023-08-30 02:57:26,430 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 76 transitions, 990 flow [2023-08-30 02:57:26,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:26,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:26,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:26,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 02:57:26,431 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:26,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:26,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1494941741, now seen corresponding path program 1 times [2023-08-30 02:57:26,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:57:26,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98453103] [2023-08-30 02:57:26,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:26,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:57:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:26,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:26,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:57:26,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98453103] [2023-08-30 02:57:26,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98453103] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:26,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:26,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:57:26,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458168082] [2023-08-30 02:57:26,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:26,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:57:26,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:57:26,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:57:26,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:57:26,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 275 [2023-08-30 02:57:26,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 76 transitions, 990 flow. Second operand has 7 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:26,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:26,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 275 [2023-08-30 02:57:26,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:27,675 INFO L130 PetriNetUnfolder]: 4914/8065 cut-off events. [2023-08-30 02:57:27,675 INFO L131 PetriNetUnfolder]: For 37495/37763 co-relation queries the response was YES. [2023-08-30 02:57:27,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34927 conditions, 8065 events. 4914/8065 cut-off events. For 37495/37763 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 55208 event pairs, 1027 based on Foata normal form. 225/8140 useless extension candidates. Maximal degree in co-relation 34895. Up to 3187 conditions per place. [2023-08-30 02:57:27,726 INFO L137 encePairwiseOnDemand]: 268/275 looper letters, 57 selfloop transitions, 17 changer transitions 101/178 dead transitions. [2023-08-30 02:57:27,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 178 transitions, 2484 flow [2023-08-30 02:57:27,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:57:27,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:57:27,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1073 transitions. [2023-08-30 02:57:27,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48772727272727273 [2023-08-30 02:57:27,731 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1073 transitions. [2023-08-30 02:57:27,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1073 transitions. [2023-08-30 02:57:27,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:27,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1073 transitions. [2023-08-30 02:57:27,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.125) internal successors, (1073), 8 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:27,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 275.0) internal successors, (2475), 9 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:27,738 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 275.0) internal successors, (2475), 9 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:27,738 INFO L175 Difference]: Start difference. First operand has 90 places, 76 transitions, 990 flow. Second operand 8 states and 1073 transitions. [2023-08-30 02:57:27,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 178 transitions, 2484 flow [2023-08-30 02:57:28,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 178 transitions, 2368 flow, removed 42 selfloop flow, removed 10 redundant places. [2023-08-30 02:57:28,104 INFO L231 Difference]: Finished difference. Result has 88 places, 41 transitions, 353 flow [2023-08-30 02:57:28,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=353, PETRI_PLACES=88, PETRI_TRANSITIONS=41} [2023-08-30 02:57:28,106 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 35 predicate places. [2023-08-30 02:57:28,106 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 41 transitions, 353 flow [2023-08-30 02:57:28,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:28,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:28,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:28,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 02:57:28,108 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:28,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:28,108 INFO L85 PathProgramCache]: Analyzing trace with hash 384218047, now seen corresponding path program 1 times [2023-08-30 02:57:28,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:57:28,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833655606] [2023-08-30 02:57:28,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:28,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:57:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:29,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:29,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:57:29,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833655606] [2023-08-30 02:57:29,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833655606] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:29,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:29,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 02:57:29,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004687524] [2023-08-30 02:57:29,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:29,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 02:57:29,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:57:29,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 02:57:29,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-30 02:57:29,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 275 [2023-08-30 02:57:29,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 41 transitions, 353 flow. Second operand has 9 states, 9 states have (on average 124.88888888888889) internal successors, (1124), 9 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:29,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:29,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 275 [2023-08-30 02:57:29,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:29,449 INFO L130 PetriNetUnfolder]: 597/969 cut-off events. [2023-08-30 02:57:29,450 INFO L131 PetriNetUnfolder]: For 3371/3371 co-relation queries the response was YES. [2023-08-30 02:57:29,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4104 conditions, 969 events. 597/969 cut-off events. For 3371/3371 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3903 event pairs, 65 based on Foata normal form. 1/970 useless extension candidates. Maximal degree in co-relation 4076. Up to 573 conditions per place. [2023-08-30 02:57:29,454 INFO L137 encePairwiseOnDemand]: 268/275 looper letters, 52 selfloop transitions, 4 changer transitions 33/92 dead transitions. [2023-08-30 02:57:29,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 92 transitions, 892 flow [2023-08-30 02:57:29,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:57:29,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:57:29,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1036 transitions. [2023-08-30 02:57:29,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4709090909090909 [2023-08-30 02:57:29,457 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1036 transitions. [2023-08-30 02:57:29,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1036 transitions. [2023-08-30 02:57:29,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:29,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1036 transitions. [2023-08-30 02:57:29,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 129.5) internal successors, (1036), 8 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:29,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 275.0) internal successors, (2475), 9 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:29,462 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 275.0) internal successors, (2475), 9 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:29,463 INFO L175 Difference]: Start difference. First operand has 88 places, 41 transitions, 353 flow. Second operand 8 states and 1036 transitions. [2023-08-30 02:57:29,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 92 transitions, 892 flow [2023-08-30 02:57:29,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 92 transitions, 560 flow, removed 63 selfloop flow, removed 34 redundant places. [2023-08-30 02:57:29,472 INFO L231 Difference]: Finished difference. Result has 61 places, 41 transitions, 179 flow [2023-08-30 02:57:29,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=179, PETRI_PLACES=61, PETRI_TRANSITIONS=41} [2023-08-30 02:57:29,472 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2023-08-30 02:57:29,472 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 41 transitions, 179 flow [2023-08-30 02:57:29,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 124.88888888888889) internal successors, (1124), 9 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:29,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:29,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:29,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 02:57:29,474 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:29,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:29,474 INFO L85 PathProgramCache]: Analyzing trace with hash -109592749, now seen corresponding path program 2 times [2023-08-30 02:57:29,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:57:29,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355695154] [2023-08-30 02:57:29,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:29,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:57:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:57:29,531 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:57:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:57:29,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:57:29,602 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:57:29,603 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:57:29,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:57:29,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:57:29,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:57:29,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:57:29,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:57:29,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:57:29,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:57:29,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:57:29,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:57:29,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:57:29,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:57:29,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:57:29,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:57:29,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:57:29,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:57:29,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 02:57:29,610 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:29,615 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:57:29,615 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:57:29,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:57:29 BasicIcfg [2023-08-30 02:57:29,684 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:57:29,685 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:57:29,685 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:57:29,685 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:57:29,685 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:56:40" (3/4) ... [2023-08-30 02:57:29,687 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:57:29,687 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:57:29,688 INFO L158 Benchmark]: Toolchain (without parser) took 50986.62ms. Allocated memory was 75.5MB in the beginning and 12.3GB in the end (delta: 12.2GB). Free memory was 52.0MB in the beginning and 10.3GB in the end (delta: -10.2GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2023-08-30 02:57:29,688 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 62.9MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:57:29,688 INFO L158 Benchmark]: CACSL2BoogieTranslator took 552.07ms. Allocated memory is still 75.5MB. Free memory was 51.8MB in the beginning and 46.1MB in the end (delta: 5.7MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2023-08-30 02:57:29,688 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.61ms. Allocated memory is still 75.5MB. Free memory was 46.1MB in the beginning and 43.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:57:29,689 INFO L158 Benchmark]: Boogie Preprocessor took 60.11ms. Allocated memory is still 75.5MB. Free memory was 43.4MB in the beginning and 41.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:57:29,689 INFO L158 Benchmark]: RCFGBuilder took 795.71ms. Allocated memory is still 75.5MB. Free memory was 41.3MB in the beginning and 48.0MB in the end (delta: -6.7MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2023-08-30 02:57:29,689 INFO L158 Benchmark]: TraceAbstraction took 49485.38ms. Allocated memory was 75.5MB in the beginning and 12.3GB in the end (delta: 12.2GB). Free memory was 47.1MB in the beginning and 10.3GB in the end (delta: -10.2GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2023-08-30 02:57:29,689 INFO L158 Benchmark]: Witness Printer took 2.65ms. Allocated memory is still 12.3GB. Free memory is still 10.3GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:57:29,691 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 62.9MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 552.07ms. Allocated memory is still 75.5MB. Free memory was 51.8MB in the beginning and 46.1MB in the end (delta: 5.7MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.61ms. Allocated memory is still 75.5MB. Free memory was 46.1MB in the beginning and 43.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.11ms. Allocated memory is still 75.5MB. Free memory was 43.4MB in the beginning and 41.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 795.71ms. Allocated memory is still 75.5MB. Free memory was 41.3MB in the beginning and 48.0MB in the end (delta: -6.7MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * TraceAbstraction took 49485.38ms. Allocated memory was 75.5MB in the beginning and 12.3GB in the end (delta: 12.2GB). Free memory was 47.1MB in the beginning and 10.3GB in the end (delta: -10.2GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 2.65ms. Allocated memory is still 12.3GB. Free memory is still 10.3GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 150 PlacesBefore, 53 PlacesAfterwards, 139 TransitionsBefore, 41 TransitionsAfterwards, 3636 CoEnabledTransitionPairs, 7 FixpointIterations, 49 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 132 TotalNumberOfCompositions, 10303 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4968, independent: 4728, independent conditional: 0, independent unconditional: 4728, dependent: 240, dependent conditional: 0, dependent unconditional: 240, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1906, independent: 1868, independent conditional: 0, independent unconditional: 1868, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4968, independent: 2860, independent conditional: 0, independent unconditional: 2860, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 1906, unknown conditional: 0, unknown unconditional: 1906] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 197, Positive conditional cache size: 0, Positive unconditional cache size: 197, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool b$flush_delayed; [L720] 0 int b$mem_tmp; [L721] 0 _Bool b$r_buff0_thd0; [L722] 0 _Bool b$r_buff0_thd1; [L723] 0 _Bool b$r_buff0_thd2; [L724] 0 _Bool b$r_buff0_thd3; [L725] 0 _Bool b$r_buff0_thd4; [L726] 0 _Bool b$r_buff1_thd0; [L727] 0 _Bool b$r_buff1_thd1; [L728] 0 _Bool b$r_buff1_thd2; [L729] 0 _Bool b$r_buff1_thd3; [L730] 0 _Bool b$r_buff1_thd4; [L731] 0 _Bool b$read_delayed; [L732] 0 int *b$read_delayed_var; [L733] 0 int b$w_buff0; [L734] 0 _Bool b$w_buff0_used; [L735] 0 int b$w_buff1; [L736] 0 _Bool b$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L867] 0 pthread_t t1249; [L868] FCALL, FORK 0 pthread_create(&t1249, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1249, ((void *)0), P0, ((void *)0))=-3, t1249={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L869] 0 pthread_t t1250; [L870] FCALL, FORK 0 pthread_create(&t1250, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1250, ((void *)0), P1, ((void *)0))=-2, t1249={5:0}, t1250={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1251; [L872] FCALL, FORK 0 pthread_create(&t1251, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1251, ((void *)0), P2, ((void *)0))=-1, t1249={5:0}, t1250={6:0}, t1251={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1252; [L874] FCALL, FORK 0 pthread_create(&t1252, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1252, ((void *)0), P3, ((void *)0))=0, t1249={5:0}, t1250={6:0}, t1251={7:0}, t1252={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 b$w_buff1 = b$w_buff0 [L751] 1 b$w_buff0 = 1 [L752] 1 b$w_buff1_used = b$w_buff0_used [L753] 1 b$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L755] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L756] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L757] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L758] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L759] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L760] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L787] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L788] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L789] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L790] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L800] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L806] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L807] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L808] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L809] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L810] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L823] 4 a = 1 [L826] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L829] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 4 b$flush_delayed = weak$$choice2 [L832] 4 b$mem_tmp = b [L833] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L834] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L835] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L836] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L837] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L839] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 __unbuffered_p3_EBX = b [L841] 4 b = b$flush_delayed ? b$mem_tmp : b [L842] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=2] [L845] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L846] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L847] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L848] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L849] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=2] [L766] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L767] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L768] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L769] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L770] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=2] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L852] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L854] 4 return 0; [L876] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L878] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L878] RET 0 assume_abort_if_not(main$tmp_guard0) [L880] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L881] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L882] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L883] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L884] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1249={5:0}, t1250={6:0}, t1251={7:0}, t1252={3:0}, weak$$choice2=1, x=2, y=2, z=2] [L887] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L889] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=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: -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: 865]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 868]: 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: 870]: 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: 874]: 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: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 181 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 49.3s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 40.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1122 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 905 mSDsluCounter, 532 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 388 mSDsCounter, 136 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2691 IncrementalHoareTripleChecker+Invalid, 2827 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 136 mSolverCounterUnsat, 144 mSDtfsCounter, 2691 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1101occurred in iteration=11, InterpolantAutomatonStates: 88, 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.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 1714 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 02:57:29,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/mix047_power.oepc_pso.oepc_rmo.oepc.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 dcc3fad0768415d67ba0b5226238487b935d262c55e83ab1790d239680fbb73d --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:57:32,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:57:32,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:57:32,275 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:57:32,278 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:57:32,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:57:32,283 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:57:32,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:57:32,288 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:57:32,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:57:32,294 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:57:32,295 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:57:32,295 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:57:32,296 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:57:32,297 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:57:32,297 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:57:32,298 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:57:32,298 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:57:32,304 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:57:32,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:57:32,320 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:57:32,322 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:57:32,323 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:57:32,324 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:57:32,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:57:32,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:57:32,332 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:57:32,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:57:32,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:57:32,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:57:32,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:57:32,341 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:57:32,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:57:32,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:57:32,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:57:32,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:57:32,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:57:32,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:57:32,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:57:32,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:57:32,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:57:32,350 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 02:57:32,387 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:57:32,388 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:57:32,389 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:57:32,389 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:57:32,390 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:57:32,390 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:57:32,391 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:57:32,391 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:57:32,391 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:57:32,391 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:57:32,392 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:57:32,392 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:57:32,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:57:32,393 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:57:32,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:57:32,393 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:57:32,393 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:57:32,393 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:57:32,394 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:57:32,394 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:57:32,394 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 02:57:32,394 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 02:57:32,394 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:57:32,395 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:57:32,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:57:32,395 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:57:32,395 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:57:32,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:57:32,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:57:32,396 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:57:32,396 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 02:57:32,396 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 02:57:32,397 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:57:32,397 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:57:32,397 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:57:32,397 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 02:57:32,397 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:57:32,398 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 -> dcc3fad0768415d67ba0b5226238487b935d262c55e83ab1790d239680fbb73d Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 02:57:32,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:57:32,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:57:32,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:57:32,724 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:57:32,724 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:57:32,725 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 02:57:33,961 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:57:34,260 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:57:34,261 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 02:57:34,279 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58fd02eaf/82ed7bbeea4b4aafb7ff9d8ca32a7748/FLAG78d898974 [2023-08-30 02:57:34,293 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58fd02eaf/82ed7bbeea4b4aafb7ff9d8ca32a7748 [2023-08-30 02:57:34,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:57:34,295 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:57:34,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:57:34,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:57:34,299 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:57:34,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:57:34" (1/1) ... [2023-08-30 02:57:34,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bd14f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:57:34, skipping insertion in model container [2023-08-30 02:57:34,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:57:34" (1/1) ... [2023-08-30 02:57:34,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:57:34,355 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:57:34,475 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/mix047_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-30 02:57:34,633 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:57:34,646 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:57:34,656 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/mix047_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-30 02:57:34,693 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:57:34,723 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:57:34,723 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:57:34,728 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:57:34,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:57:34 WrapperNode [2023-08-30 02:57:34,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:57:34,730 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:57:34,730 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:57:34,730 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:57:34,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:57:34" (1/1) ... [2023-08-30 02:57:34,764 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:57:34" (1/1) ... [2023-08-30 02:57:34,803 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-30 02:57:34,804 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:57:34,805 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:57:34,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:57:34,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:57:34,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:57:34" (1/1) ... [2023-08-30 02:57:34,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:57:34" (1/1) ... [2023-08-30 02:57:34,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:57:34" (1/1) ... [2023-08-30 02:57:34,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:57:34" (1/1) ... [2023-08-30 02:57:34,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:57:34" (1/1) ... [2023-08-30 02:57:34,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:57:34" (1/1) ... [2023-08-30 02:57:34,855 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:57:34" (1/1) ... [2023-08-30 02:57:34,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:57:34" (1/1) ... [2023-08-30 02:57:34,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:57:34,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:57:34,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:57:34,872 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:57:34,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:57:34" (1/1) ... [2023-08-30 02:57:34,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:57:34,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:57:34,899 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 02:57:34,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 02:57:34,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:57:34,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:57:34,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:57:34,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:57:34,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 02:57:34,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 02:57:34,942 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:57:34,942 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:57:34,942 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:57:34,942 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:57:34,943 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:57:34,943 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:57:34,943 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:57:34,943 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:57:34,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:57:34,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:57:34,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:57:34,945 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:57:35,151 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:57:35,153 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:57:35,617 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:57:35,810 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:57:35,810 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:57:35,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:57:35 BoogieIcfgContainer [2023-08-30 02:57:35,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:57:35,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:57:35,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:57:35,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:57:35,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:57:34" (1/3) ... [2023-08-30 02:57:35,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7a175c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:57:35, skipping insertion in model container [2023-08-30 02:57:35,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:57:34" (2/3) ... [2023-08-30 02:57:35,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7a175c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:57:35, skipping insertion in model container [2023-08-30 02:57:35,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:57:35" (3/3) ... [2023-08-30 02:57:35,821 INFO L112 eAbstractionObserver]: Analyzing ICFG mix047_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 02:57:35,838 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:57:35,838 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:57:35,838 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:57:35,923 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:57:35,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 144 transitions, 308 flow [2023-08-30 02:57:36,050 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2023-08-30 02:57:36,050 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:57:36,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-30 02:57:36,056 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 144 transitions, 308 flow [2023-08-30 02:57:36,063 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 140 transitions, 292 flow [2023-08-30 02:57:36,067 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:57:36,086 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 140 transitions, 292 flow [2023-08-30 02:57:36,089 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 140 transitions, 292 flow [2023-08-30 02:57:36,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 292 flow [2023-08-30 02:57:36,142 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2023-08-30 02:57:36,142 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:57:36,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-30 02:57:36,148 INFO L119 LiptonReduction]: Number of co-enabled transitions 3636 [2023-08-30 02:57:42,996 INFO L134 LiptonReduction]: Checked pairs total: 10446 [2023-08-30 02:57:42,996 INFO L136 LiptonReduction]: Total number of compositions: 139 [2023-08-30 02:57:43,008 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:57:43,013 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;@111433e1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:57:43,014 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:57:43,015 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:57:43,015 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:57:43,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:43,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:57:43,017 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:43,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:43,021 INFO L85 PathProgramCache]: Analyzing trace with hash 615, now seen corresponding path program 1 times [2023-08-30 02:57:43,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:57:43,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636756968] [2023-08-30 02:57:43,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:43,035 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:57:43,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:57:43,036 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:57:43,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-30 02:57:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:43,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 02:57:43,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:57:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:43,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:57:43,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:57:43,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636756968] [2023-08-30 02:57:43,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636756968] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:43,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:43,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:57:43,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412335723] [2023-08-30 02:57:43,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:43,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:57:43,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:57:43,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:57:43,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:57:43,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 283 [2023-08-30 02:57:43,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:43,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:43,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 283 [2023-08-30 02:57:43,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:44,908 INFO L130 PetriNetUnfolder]: 10487/14083 cut-off events. [2023-08-30 02:57:44,909 INFO L131 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2023-08-30 02:57:44,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28359 conditions, 14083 events. 10487/14083 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 72419 event pairs, 10487 based on Foata normal form. 0/12389 useless extension candidates. Maximal degree in co-relation 28347. Up to 14059 conditions per place. [2023-08-30 02:57:45,012 INFO L137 encePairwiseOnDemand]: 274/283 looper letters, 29 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-08-30 02:57:45,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 134 flow [2023-08-30 02:57:45,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:57:45,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:57:45,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 296 transitions. [2023-08-30 02:57:45,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5229681978798587 [2023-08-30 02:57:45,031 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 296 transitions. [2023-08-30 02:57:45,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 296 transitions. [2023-08-30 02:57:45,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:45,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 296 transitions. [2023-08-30 02:57:45,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 148.0) internal successors, (296), 2 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:45,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:45,048 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:45,050 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 296 transitions. [2023-08-30 02:57:45,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 134 flow [2023-08-30 02:57:45,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:57:45,063 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-08-30 02:57:45,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-30 02:57:45,071 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-30 02:57:45,072 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-08-30 02:57:45,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:45,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:45,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:57:45,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-30 02:57:45,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:57:45,284 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:45,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:45,284 INFO L85 PathProgramCache]: Analyzing trace with hash 604208, now seen corresponding path program 1 times [2023-08-30 02:57:45,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:57:45,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578944852] [2023-08-30 02:57:45,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:45,286 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:57:45,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:57:45,287 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:57:45,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-30 02:57:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:45,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:57:45,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:57:45,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:45,431 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:57:45,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:57:45,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578944852] [2023-08-30 02:57:45,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578944852] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:45,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:45,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:57:45,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47588380] [2023-08-30 02:57:45,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:45,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:57:45,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:57:45,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:57:45,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:57:45,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 283 [2023-08-30 02:57:45,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:45,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:45,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 283 [2023-08-30 02:57:45,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:46,731 INFO L130 PetriNetUnfolder]: 8247/11291 cut-off events. [2023-08-30 02:57:46,731 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:57:46,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22568 conditions, 11291 events. 8247/11291 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 58626 event pairs, 3119 based on Foata normal form. 0/10519 useless extension candidates. Maximal degree in co-relation 22565. Up to 8863 conditions per place. [2023-08-30 02:57:46,809 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 47 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2023-08-30 02:57:46,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 224 flow [2023-08-30 02:57:46,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:57:46,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:57:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2023-08-30 02:57:46,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135453474676089 [2023-08-30 02:57:46,812 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions. [2023-08-30 02:57:46,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions. [2023-08-30 02:57:46,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:46,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions. [2023-08-30 02:57:46,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:46,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:46,817 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:46,817 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 436 transitions. [2023-08-30 02:57:46,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 224 flow [2023-08-30 02:57:46,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 224 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:57:46,819 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-08-30 02:57:46,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-30 02:57:46,820 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-08-30 02:57:46,820 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-08-30 02:57:46,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:46,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:46,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:46,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-30 02:57:47,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:57:47,031 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:47,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:47,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1701031173, now seen corresponding path program 1 times [2023-08-30 02:57:47,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:57:47,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129157631] [2023-08-30 02:57:47,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:47,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:57:47,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:57:47,035 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:57:47,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-30 02:57:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:47,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:57:47,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:57:47,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:47,185 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:57:47,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:57:47,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129157631] [2023-08-30 02:57:47,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129157631] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:47,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:47,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:57:47,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874907570] [2023-08-30 02:57:47,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:47,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:57:47,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:57:47,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:57:47,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:57:47,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 283 [2023-08-30 02:57:47,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:47,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:47,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 283 [2023-08-30 02:57:47,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:48,125 INFO L130 PetriNetUnfolder]: 5298/7496 cut-off events. [2023-08-30 02:57:48,125 INFO L131 PetriNetUnfolder]: For 488/488 co-relation queries the response was YES. [2023-08-30 02:57:48,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15640 conditions, 7496 events. 5298/7496 cut-off events. For 488/488 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 40271 event pairs, 929 based on Foata normal form. 384/7618 useless extension candidates. Maximal degree in co-relation 15636. Up to 5568 conditions per place. [2023-08-30 02:57:48,180 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 42 selfloop transitions, 5 changer transitions 29/79 dead transitions. [2023-08-30 02:57:48,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 79 transitions, 334 flow [2023-08-30 02:57:48,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:57:48,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:57:48,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 678 transitions. [2023-08-30 02:57:48,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791519434628975 [2023-08-30 02:57:48,183 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 678 transitions. [2023-08-30 02:57:48,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 678 transitions. [2023-08-30 02:57:48,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:48,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 678 transitions. [2023-08-30 02:57:48,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:48,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:48,188 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:48,188 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 5 states and 678 transitions. [2023-08-30 02:57:48,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 79 transitions, 334 flow [2023-08-30 02:57:48,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 79 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:57:48,191 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 113 flow [2023-08-30 02:57:48,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-08-30 02:57:48,191 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2023-08-30 02:57:48,192 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 113 flow [2023-08-30 02:57:48,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:48,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:48,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:48,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-30 02:57:48,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:57:48,403 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:48,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:48,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1621779517, now seen corresponding path program 1 times [2023-08-30 02:57:48,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:57:48,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503223057] [2023-08-30 02:57:48,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:48,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:57:48,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:57:48,405 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:57:48,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-30 02:57:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:48,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:57:48,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:57:48,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:48,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:57:48,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:57:48,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503223057] [2023-08-30 02:57:48,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503223057] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:48,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:48,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:57:48,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234953846] [2023-08-30 02:57:48,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:48,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:57:48,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:57:48,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:57:48,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:57:48,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 283 [2023-08-30 02:57:48,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:48,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:48,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 283 [2023-08-30 02:57:48,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:49,223 INFO L130 PetriNetUnfolder]: 2490/3744 cut-off events. [2023-08-30 02:57:49,224 INFO L131 PetriNetUnfolder]: For 1322/1322 co-relation queries the response was YES. [2023-08-30 02:57:49,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9844 conditions, 3744 events. 2490/3744 cut-off events. For 1322/1322 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 19418 event pairs, 462 based on Foata normal form. 249/3893 useless extension candidates. Maximal degree in co-relation 9837. Up to 1608 conditions per place. [2023-08-30 02:57:49,241 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 56 selfloop transitions, 9 changer transitions 29/97 dead transitions. [2023-08-30 02:57:49,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 97 transitions, 487 flow [2023-08-30 02:57:49,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:57:49,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:57:49,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 816 transitions. [2023-08-30 02:57:49,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48056537102473496 [2023-08-30 02:57:49,245 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 816 transitions. [2023-08-30 02:57:49,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 816 transitions. [2023-08-30 02:57:49,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:49,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 816 transitions. [2023-08-30 02:57:49,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.0) internal successors, (816), 6 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:49,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:49,251 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:49,251 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 113 flow. Second operand 6 states and 816 transitions. [2023-08-30 02:57:49,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 97 transitions, 487 flow [2023-08-30 02:57:49,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 97 transitions, 480 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:57:49,269 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 178 flow [2023-08-30 02:57:49,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-08-30 02:57:49,271 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2023-08-30 02:57:49,271 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 178 flow [2023-08-30 02:57:49,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:49,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:49,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] [2023-08-30 02:57:49,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-30 02:57:49,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:57:49,485 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:49,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:49,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1790806365, now seen corresponding path program 1 times [2023-08-30 02:57:49,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:57:49,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540881535] [2023-08-30 02:57:49,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:49,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:57:49,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:57:49,487 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:57:49,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-30 02:57:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:49,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 02:57:49,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:57:49,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:49,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:57:49,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:57:49,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540881535] [2023-08-30 02:57:49,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540881535] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:49,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:49,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:57:49,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381675264] [2023-08-30 02:57:49,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:49,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:57:49,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:57:49,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:57:49,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:57:49,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 283 [2023-08-30 02:57:49,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:49,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:49,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 283 [2023-08-30 02:57:49,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:50,175 INFO L130 PetriNetUnfolder]: 1356/2088 cut-off events. [2023-08-30 02:57:50,175 INFO L131 PetriNetUnfolder]: For 2024/2024 co-relation queries the response was YES. [2023-08-30 02:57:50,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6227 conditions, 2088 events. 1356/2088 cut-off events. For 2024/2024 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 10104 event pairs, 385 based on Foata normal form. 87/2147 useless extension candidates. Maximal degree in co-relation 6218. Up to 720 conditions per place. [2023-08-30 02:57:50,187 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 68 selfloop transitions, 13 changer transitions 29/113 dead transitions. [2023-08-30 02:57:50,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 113 transitions, 660 flow [2023-08-30 02:57:50,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:57:50,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:57:50,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 952 transitions. [2023-08-30 02:57:50,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48056537102473496 [2023-08-30 02:57:50,191 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 952 transitions. [2023-08-30 02:57:50,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 952 transitions. [2023-08-30 02:57:50,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:50,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 952 transitions. [2023-08-30 02:57:50,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:50,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:50,197 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:50,198 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 178 flow. Second operand 7 states and 952 transitions. [2023-08-30 02:57:50,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 113 transitions, 660 flow [2023-08-30 02:57:50,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 113 transitions, 598 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-30 02:57:50,224 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 228 flow [2023-08-30 02:57:50,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=228, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2023-08-30 02:57:50,225 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2023-08-30 02:57:50,225 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 228 flow [2023-08-30 02:57:50,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:50,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:50,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:50,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-30 02:57:50,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:57:50,436 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:50,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:50,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1382738223, now seen corresponding path program 1 times [2023-08-30 02:57:50,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:57:50,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640728766] [2023-08-30 02:57:50,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:50,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:57:50,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:57:50,438 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:57:50,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-30 02:57:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:50,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 02:57:50,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:57:50,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:50,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:57:50,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:57:50,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [640728766] [2023-08-30 02:57:50,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [640728766] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:50,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:50,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:57:50,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95684895] [2023-08-30 02:57:50,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:50,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:57:50,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:57:50,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:57:50,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:57:50,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 283 [2023-08-30 02:57:50,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 228 flow. Second operand has 7 states, 7 states have (on average 122.85714285714286) internal successors, (860), 7 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:50,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:50,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 283 [2023-08-30 02:57:50,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:51,195 INFO L130 PetriNetUnfolder]: 1156/1746 cut-off events. [2023-08-30 02:57:51,195 INFO L131 PetriNetUnfolder]: For 1638/1638 co-relation queries the response was YES. [2023-08-30 02:57:51,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5043 conditions, 1746 events. 1156/1746 cut-off events. For 1638/1638 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8233 event pairs, 380 based on Foata normal form. 15/1747 useless extension candidates. Maximal degree in co-relation 5033. Up to 720 conditions per place. [2023-08-30 02:57:51,207 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 64 selfloop transitions, 17 changer transitions 15/99 dead transitions. [2023-08-30 02:57:51,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 99 transitions, 592 flow [2023-08-30 02:57:51,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:57:51,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:57:51,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1058 transitions. [2023-08-30 02:57:51,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4673144876325088 [2023-08-30 02:57:51,210 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1058 transitions. [2023-08-30 02:57:51,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1058 transitions. [2023-08-30 02:57:51,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:51,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1058 transitions. [2023-08-30 02:57:51,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 132.25) internal successors, (1058), 8 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:51,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 283.0) internal successors, (2547), 9 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:51,217 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 283.0) internal successors, (2547), 9 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:51,217 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 228 flow. Second operand 8 states and 1058 transitions. [2023-08-30 02:57:51,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 99 transitions, 592 flow [2023-08-30 02:57:51,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 99 transitions, 530 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-30 02:57:51,236 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 222 flow [2023-08-30 02:57:51,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=222, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2023-08-30 02:57:51,238 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2023-08-30 02:57:51,238 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 222 flow [2023-08-30 02:57:51,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.85714285714286) internal successors, (860), 7 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:51,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:51,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:51,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-30 02:57:51,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:57:51,450 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:51,450 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:51,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1314521933, now seen corresponding path program 1 times [2023-08-30 02:57:51,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:57:51,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579723680] [2023-08-30 02:57:51,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:57:51,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:57:51,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:57:51,452 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:57:51,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-30 02:57:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:57:51,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-30 02:57:51,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:57:52,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:52,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:57:52,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:57:52,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579723680] [2023-08-30 02:57:52,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579723680] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:52,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:52,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:57:52,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622179340] [2023-08-30 02:57:52,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:52,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:57:52,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:57:52,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:57:52,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:57:52,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 283 [2023-08-30 02:57:52,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 222 flow. Second operand has 8 states, 8 states have (on average 126.125) internal successors, (1009), 8 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:52,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:52,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 283 [2023-08-30 02:57:52,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:52,544 INFO L130 PetriNetUnfolder]: 1303/2004 cut-off events. [2023-08-30 02:57:52,544 INFO L131 PetriNetUnfolder]: For 2127/2127 co-relation queries the response was YES. [2023-08-30 02:57:52,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5893 conditions, 2004 events. 1303/2004 cut-off events. For 2127/2127 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9643 event pairs, 192 based on Foata normal form. 0/1999 useless extension candidates. Maximal degree in co-relation 5882. Up to 885 conditions per place. [2023-08-30 02:57:52,556 INFO L137 encePairwiseOnDemand]: 277/283 looper letters, 104 selfloop transitions, 6 changer transitions 0/113 dead transitions. [2023-08-30 02:57:52,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 113 transitions, 824 flow [2023-08-30 02:57:52,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:57:52,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:57:52,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 936 transitions. [2023-08-30 02:57:52,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4724886420999495 [2023-08-30 02:57:52,560 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 936 transitions. [2023-08-30 02:57:52,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 936 transitions. [2023-08-30 02:57:52,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:52,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 936 transitions. [2023-08-30 02:57:52,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.71428571428572) internal successors, (936), 7 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:52,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:52,565 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:52,565 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 222 flow. Second operand 7 states and 936 transitions. [2023-08-30 02:57:52,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 113 transitions, 824 flow [2023-08-30 02:57:52,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 113 transitions, 668 flow, removed 38 selfloop flow, removed 7 redundant places. [2023-08-30 02:57:52,579 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 182 flow [2023-08-30 02:57:52,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2023-08-30 02:57:52,580 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2023-08-30 02:57:52,580 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 182 flow [2023-08-30 02:57:52,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 126.125) internal successors, (1009), 8 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:52,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:52,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:52,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-30 02:57:52,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:57:52,792 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:52,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:52,792 INFO L85 PathProgramCache]: Analyzing trace with hash -618495593, now seen corresponding path program 2 times [2023-08-30 02:57:52,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:57:52,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341052417] [2023-08-30 02:57:52,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:57:52,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:57:52,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:57:52,794 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:57:52,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-30 02:57:52,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:57:52,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:57:52,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:57:52,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:57:52,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:52,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:57:52,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:57:52,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341052417] [2023-08-30 02:57:52,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341052417] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:52,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:52,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:57:52,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998756777] [2023-08-30 02:57:52,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:52,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:57:52,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:57:52,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:57:52,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:57:52,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 283 [2023-08-30 02:57:52,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:52,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:52,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 283 [2023-08-30 02:57:52,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:53,355 INFO L130 PetriNetUnfolder]: 2312/3503 cut-off events. [2023-08-30 02:57:53,356 INFO L131 PetriNetUnfolder]: For 3176/3176 co-relation queries the response was YES. [2023-08-30 02:57:53,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10112 conditions, 3503 events. 2312/3503 cut-off events. For 3176/3176 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 18884 event pairs, 973 based on Foata normal form. 1/3483 useless extension candidates. Maximal degree in co-relation 10102. Up to 2015 conditions per place. [2023-08-30 02:57:53,383 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 75 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2023-08-30 02:57:53,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 79 transitions, 490 flow [2023-08-30 02:57:53,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:57:53,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:57:53,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2023-08-30 02:57:53,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5041224970553593 [2023-08-30 02:57:53,386 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2023-08-30 02:57:53,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2023-08-30 02:57:53,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:53,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2023-08-30 02:57:53,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 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 02:57:53,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:53,389 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:53,390 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 182 flow. Second operand 3 states and 428 transitions. [2023-08-30 02:57:53,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 79 transitions, 490 flow [2023-08-30 02:57:53,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 79 transitions, 480 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:57:53,419 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 188 flow [2023-08-30 02:57:53,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2023-08-30 02:57:53,420 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2023-08-30 02:57:53,420 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 188 flow [2023-08-30 02:57:53,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:53,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:53,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:53,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-30 02:57:53,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:57:53,640 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:53,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:53,640 INFO L85 PathProgramCache]: Analyzing trace with hash -705638027, now seen corresponding path program 3 times [2023-08-30 02:57:53,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:57:53,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220747669] [2023-08-30 02:57:53,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:57:53,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:57:53,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:57:53,646 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 02:57:53,647 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 02:57:53,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 02:57:53,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:57:53,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:57:53,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:57:53,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:57:53,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:57:53,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:57:53,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220747669] [2023-08-30 02:57:53,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220747669] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:53,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:53,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:57:53,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621150968] [2023-08-30 02:57:53,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:53,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:57:53,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:57:53,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:57:53,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:57:53,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 283 [2023-08-30 02:57:53,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:53,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:53,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 283 [2023-08-30 02:57:53,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:54,364 INFO L130 PetriNetUnfolder]: 3691/5645 cut-off events. [2023-08-30 02:57:54,364 INFO L131 PetriNetUnfolder]: For 4250/4253 co-relation queries the response was YES. [2023-08-30 02:57:54,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16667 conditions, 5645 events. 3691/5645 cut-off events. For 4250/4253 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 33589 event pairs, 1515 based on Foata normal form. 2/5635 useless extension candidates. Maximal degree in co-relation 16656. Up to 3196 conditions per place. [2023-08-30 02:57:54,400 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 79 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-08-30 02:57:54,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 83 transitions, 513 flow [2023-08-30 02:57:54,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:57:54,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:57:54,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2023-08-30 02:57:54,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5064782096584217 [2023-08-30 02:57:54,402 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2023-08-30 02:57:54,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2023-08-30 02:57:54,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:54,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2023-08-30 02:57:54,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:54,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:54,406 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:54,406 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 188 flow. Second operand 3 states and 430 transitions. [2023-08-30 02:57:54,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 83 transitions, 513 flow [2023-08-30 02:57:54,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 83 transitions, 510 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:57:54,491 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 198 flow [2023-08-30 02:57:54,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2023-08-30 02:57:54,491 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2023-08-30 02:57:54,492 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 198 flow [2023-08-30 02:57:54,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:54,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:54,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:54,502 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 (10)] Ended with exit code 0 [2023-08-30 02:57:54,698 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 02:57:54,699 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:54,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:54,699 INFO L85 PathProgramCache]: Analyzing trace with hash -2129549257, now seen corresponding path program 4 times [2023-08-30 02:57:54,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:57:54,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745351558] [2023-08-30 02:57:54,700 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 02:57:54,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:57:54,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:57:54,701 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 02:57:54,702 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 02:57:54,821 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 02:57:54,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:57:54,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:57:54,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:57:54,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 02:57:54,842 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:57:54,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:57:54,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745351558] [2023-08-30 02:57:54,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745351558] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:57:54,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:57:54,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:57:54,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250228649] [2023-08-30 02:57:54,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:57:54,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:57:54,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:57:54,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:57:54,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:57:54,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 283 [2023-08-30 02:57:54,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:54,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:57:54,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 283 [2023-08-30 02:57:54,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:57:55,694 INFO L130 PetriNetUnfolder]: 5902/8995 cut-off events. [2023-08-30 02:57:55,694 INFO L131 PetriNetUnfolder]: For 7829/7834 co-relation queries the response was YES. [2023-08-30 02:57:55,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26952 conditions, 8995 events. 5902/8995 cut-off events. For 7829/7834 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 55746 event pairs, 1992 based on Foata normal form. 1/8991 useless extension candidates. Maximal degree in co-relation 26940. Up to 4760 conditions per place. [2023-08-30 02:57:55,741 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 76 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2023-08-30 02:57:55,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 80 transitions, 505 flow [2023-08-30 02:57:55,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:57:55,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:57:55,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-08-30 02:57:55,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5017667844522968 [2023-08-30 02:57:55,744 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-08-30 02:57:55,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-08-30 02:57:55,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:57:55,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-08-30 02:57:55,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:55,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:55,747 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:55,748 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 198 flow. Second operand 3 states and 426 transitions. [2023-08-30 02:57:55,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 80 transitions, 505 flow [2023-08-30 02:57:55,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 80 transitions, 502 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:57:55,874 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 208 flow [2023-08-30 02:57:55,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2023-08-30 02:57:55,875 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2023-08-30 02:57:55,875 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 208 flow [2023-08-30 02:57:55,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:57:55,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:57:55,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:55,884 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 (11)] Ended with exit code 0 [2023-08-30 02:57:56,076 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 02:57:56,076 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:57:56,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:57:56,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1915433293, now seen corresponding path program 5 times [2023-08-30 02:57:56,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:57:56,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994416393] [2023-08-30 02:57:56,077 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 02:57:56,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:57:56,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:57:56,078 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 02:57:56,079 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 02:57:56,200 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:57:56,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 02:57:56,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:57:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:57:56,331 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 02:57:56,331 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:57:56,332 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:57:56,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:57:56,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:57:56,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:57:56,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:57:56,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:57:56,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:57:56,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:57:56,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:57:56,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:57:56,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:57:56,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:57:56,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:57:56,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:57:56,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:57:56,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:57:56,347 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 02:57:56,547 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 02:57:56,548 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2023-08-30 02:57:56,553 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:57:56,553 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:57:56,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:57:56 BasicIcfg [2023-08-30 02:57:56,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:57:56,634 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:57:56,634 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:57:56,634 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:57:56,634 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:57:35" (3/4) ... [2023-08-30 02:57:56,636 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:57:56,636 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:57:56,637 INFO L158 Benchmark]: Toolchain (without parser) took 22341.67ms. Allocated memory was 102.8MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 79.6MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 363.9MB. Max. memory is 16.1GB. [2023-08-30 02:57:56,637 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 73.4MB. Free memory is still 52.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:57:56,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.23ms. Allocated memory is still 102.8MB. Free memory was 79.6MB in the beginning and 54.7MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-08-30 02:57:56,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.01ms. Allocated memory is still 102.8MB. Free memory was 54.7MB in the beginning and 52.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:57:56,638 INFO L158 Benchmark]: Boogie Preprocessor took 55.16ms. Allocated memory is still 102.8MB. Free memory was 52.1MB in the beginning and 50.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:57:56,638 INFO L158 Benchmark]: RCFGBuilder took 951.77ms. Allocated memory is still 102.8MB. Free memory was 50.0MB in the beginning and 49.6MB in the end (delta: 431.7kB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2023-08-30 02:57:56,639 INFO L158 Benchmark]: TraceAbstraction took 20818.00ms. Allocated memory was 102.8MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 48.9MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 333.2MB. Max. memory is 16.1GB. [2023-08-30 02:57:56,639 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 2.0GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:57:56,640 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.10ms. Allocated memory is still 73.4MB. Free memory is still 52.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 433.23ms. Allocated memory is still 102.8MB. Free memory was 79.6MB in the beginning and 54.7MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.01ms. Allocated memory is still 102.8MB. Free memory was 54.7MB in the beginning and 52.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.16ms. Allocated memory is still 102.8MB. Free memory was 52.1MB in the beginning and 50.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 951.77ms. Allocated memory is still 102.8MB. Free memory was 50.0MB in the beginning and 49.6MB in the end (delta: 431.7kB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * TraceAbstraction took 20818.00ms. Allocated memory was 102.8MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 48.9MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 333.2MB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 2.0GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.9s, 151 PlacesBefore, 53 PlacesAfterwards, 140 TransitionsBefore, 41 TransitionsAfterwards, 3636 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 139 TotalNumberOfCompositions, 10446 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4797, independent: 4549, independent conditional: 0, independent unconditional: 4549, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1967, independent: 1919, independent conditional: 0, independent unconditional: 1919, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4797, independent: 2630, independent conditional: 0, independent unconditional: 2630, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 1967, unknown conditional: 0, unknown unconditional: 1967] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 184, Positive conditional cache size: 0, Positive unconditional cache size: 184, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool b$flush_delayed; [L720] 0 int b$mem_tmp; [L721] 0 _Bool b$r_buff0_thd0; [L722] 0 _Bool b$r_buff0_thd1; [L723] 0 _Bool b$r_buff0_thd2; [L724] 0 _Bool b$r_buff0_thd3; [L725] 0 _Bool b$r_buff0_thd4; [L726] 0 _Bool b$r_buff1_thd0; [L727] 0 _Bool b$r_buff1_thd1; [L728] 0 _Bool b$r_buff1_thd2; [L729] 0 _Bool b$r_buff1_thd3; [L730] 0 _Bool b$r_buff1_thd4; [L731] 0 _Bool b$read_delayed; [L732] 0 int *b$read_delayed_var; [L733] 0 int b$w_buff0; [L734] 0 _Bool b$w_buff0_used; [L735] 0 int b$w_buff1; [L736] 0 _Bool b$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L867] 0 pthread_t t1249; [L868] FCALL, FORK 0 pthread_create(&t1249, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1249, ((void *)0), P0, ((void *)0))=0, t1249={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L869] 0 pthread_t t1250; [L750] 1 b$w_buff1 = b$w_buff0 [L751] 1 b$w_buff0 = 1 [L752] 1 b$w_buff1_used = b$w_buff0_used [L753] 1 b$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L755] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L756] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L757] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L758] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L759] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L760] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] FCALL, FORK 0 pthread_create(&t1250, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1250, ((void *)0), P1, ((void *)0))=1, t1249={3:0}, t1250={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1251; [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L787] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L788] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L789] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L790] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L872] FCALL, FORK 0 pthread_create(&t1251, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1251, ((void *)0), P2, ((void *)0))=2, t1249={3:0}, t1250={7:0}, t1251={11:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L873] 0 pthread_t t1252; [L800] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L874] FCALL, FORK 0 pthread_create(&t1252, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1252, ((void *)0), P3, ((void *)0))=3, t1249={3:0}, t1250={7:0}, t1251={11:0}, t1252={15:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L806] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L807] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L808] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L809] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L810] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L823] 4 a = 1 [L826] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L829] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 4 b$flush_delayed = weak$$choice2 [L832] 4 b$mem_tmp = b [L833] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L834] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L835] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L836] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L837] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L839] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 __unbuffered_p3_EBX = b [L841] 4 b = b$flush_delayed ? b$mem_tmp : b [L842] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L766] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L767] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L768] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L769] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L770] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L845] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L846] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L847] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L848] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L849] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L852] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L854] 4 return 0; [L876] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L878] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L878] RET 0 assume_abort_if_not(main$tmp_guard0) [L880] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L881] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L882] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L883] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L884] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1249={3:0}, t1250={7:0}, t1251={11:0}, t1252={15:0}, weak$$choice2=0, x=2, y=2, z=2] [L887] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L889] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=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: -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: 865]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 868]: 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: 870]: 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: 874]: 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: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 182 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 467 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 396 mSDsluCounter, 146 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1804 IncrementalHoareTripleChecker+Invalid, 1874 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 26 mSDtfsCounter, 1804 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=5, InterpolantAutomatonStates: 47, 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, 0.8s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 715 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1505 ConjunctsInSsa, 64 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 02:57:56,664 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