./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:51:07,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:51:07,722 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:51:07,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:51:07,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:51:07,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:51:07,762 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:51:07,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:51:07,765 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:51:07,769 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:51:07,770 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:51:07,772 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:51:07,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:51:07,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:51:07,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:51:07,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:51:07,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:51:07,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:51:07,782 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:51:07,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:51:07,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:51:07,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:51:07,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:51:07,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:51:07,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:51:07,802 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:51:07,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:51:07,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:51:07,804 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:51:07,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:51:07,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:51:07,810 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:51:07,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:51:07,812 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:51:07,813 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:51:07,813 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:51:07,814 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:51:07,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:51:07,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:51:07,814 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:51:07,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:51:07,816 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 20:51:07,843 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:51:07,843 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:51:07,844 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:51:07,844 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:51:07,845 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:51:07,845 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:51:07,846 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:51:07,846 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:51:07,846 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:51:07,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:51:07,847 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:51:07,847 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:51:07,847 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:51:07,848 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:51:07,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:51:07,848 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:51:07,848 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:51:07,848 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:51:07,848 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:51:07,849 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:51:07,849 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:51:07,849 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:51:07,849 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:51:07,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:51:07,850 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:51:07,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:51:07,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:51:07,850 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:51:07,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:51:07,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:51:07,851 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:51:07,851 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:51:07,851 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:51:07,851 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:51:07,851 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 -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 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 -> AFTER [2023-08-29 20:51:08,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:51:08,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:51:08,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:51:08,134 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:51:08,134 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:51:08,135 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-29 20:51:09,090 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:51:09,347 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:51:09,348 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-29 20:51:09,379 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31d88839e/8cd7817d307e40a7ba284f94f4bdfe01/FLAGc8314e122 [2023-08-29 20:51:09,394 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31d88839e/8cd7817d307e40a7ba284f94f4bdfe01 [2023-08-29 20:51:09,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:51:09,397 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:51:09,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:51:09,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:51:09,402 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:51:09,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:51:09" (1/1) ... [2023-08-29 20:51:09,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@734ac7f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:09, skipping insertion in model container [2023-08-29 20:51:09,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:51:09" (1/1) ... [2023-08-29 20:51:09,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:51:09,448 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:51:09,582 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-08-29 20:51:09,780 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:51:09,791 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:51:09,800 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-08-29 20:51:09,847 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:51:09,888 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:51:09,890 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:51:09,894 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:51:09,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:09 WrapperNode [2023-08-29 20:51:09,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:51:09,896 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:51:09,896 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:51:09,896 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:51:09,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:09" (1/1) ... [2023-08-29 20:51:09,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:09" (1/1) ... [2023-08-29 20:51:09,953 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-08-29 20:51:09,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:51:09,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:51:09,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:51:09,955 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:51:09,960 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:09" (1/1) ... [2023-08-29 20:51:09,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:09" (1/1) ... [2023-08-29 20:51:09,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:09" (1/1) ... [2023-08-29 20:51:09,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:09" (1/1) ... [2023-08-29 20:51:09,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:09" (1/1) ... [2023-08-29 20:51:09,984 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:09" (1/1) ... [2023-08-29 20:51:09,986 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:09" (1/1) ... [2023-08-29 20:51:09,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:09" (1/1) ... [2023-08-29 20:51:09,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:51:09,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:51:09,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:51:09,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:51:09,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:09" (1/1) ... [2023-08-29 20:51:09,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:51:10,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:51:10,030 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-29 20:51:10,062 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-29 20:51:10,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:51:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:51:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:51:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:51:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:51:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:51:10,074 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:51:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:51:10,074 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:51:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:51:10,075 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:51:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:51:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:51:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:51:10,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:51:10,076 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:51:10,175 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:51:10,177 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:51:10,486 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:51:10,622 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:51:10,622 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:51:10,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:51:10 BoogieIcfgContainer [2023-08-29 20:51:10,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:51:10,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:51:10,625 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:51:10,627 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:51:10,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:51:09" (1/3) ... [2023-08-29 20:51:10,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be1fd67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:51:10, skipping insertion in model container [2023-08-29 20:51:10,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:09" (2/3) ... [2023-08-29 20:51:10,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be1fd67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:51:10, skipping insertion in model container [2023-08-29 20:51:10,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:51:10" (3/3) ... [2023-08-29 20:51:10,629 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-29 20:51:10,639 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:51:10,639 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-29 20:51:10,640 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:51:10,686 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:51:10,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2023-08-29 20:51:10,763 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2023-08-29 20:51:10,763 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:10,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-29 20:51:10,768 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2023-08-29 20:51:10,773 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2023-08-29 20:51:10,778 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:51:10,786 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 114 transitions, 237 flow [2023-08-29 20:51:10,788 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 114 transitions, 237 flow [2023-08-29 20:51:10,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 237 flow [2023-08-29 20:51:10,817 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2023-08-29 20:51:10,817 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:10,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-29 20:51:10,819 INFO L119 LiptonReduction]: Number of co-enabled transitions 2088 [2023-08-29 20:51:15,516 INFO L134 LiptonReduction]: Checked pairs total: 5887 [2023-08-29 20:51:15,517 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-08-29 20:51:15,533 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:51:15,540 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;@33ac040b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:51:15,540 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-29 20:51:15,541 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:51:15,541 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:15,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:15,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:51:15,543 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:15,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:15,547 INFO L85 PathProgramCache]: Analyzing trace with hash 578, now seen corresponding path program 1 times [2023-08-29 20:51:15,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:15,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467732415] [2023-08-29 20:51:15,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:15,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:15,629 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-29 20:51:15,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:15,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467732415] [2023-08-29 20:51:15,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467732415] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:15,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:15,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:51:15,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519364491] [2023-08-29 20:51:15,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:15,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:51:15,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:15,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:51:15,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:51:15,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 226 [2023-08-29 20:51:15,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 69 flow. Second operand has 2 states, 2 states have (on average 102.5) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:15,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:15,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 226 [2023-08-29 20:51:15,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:16,058 INFO L130 PetriNetUnfolder]: 1679/2480 cut-off events. [2023-08-29 20:51:16,058 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2023-08-29 20:51:16,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4999 conditions, 2480 events. 1679/2480 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11139 event pairs, 1679 based on Foata normal form. 0/2076 useless extension candidates. Maximal degree in co-relation 4988. Up to 2457 conditions per place. [2023-08-29 20:51:16,073 INFO L137 encePairwiseOnDemand]: 220/226 looper letters, 23 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2023-08-29 20:51:16,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 103 flow [2023-08-29 20:51:16,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:51:16,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:51:16,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 233 transitions. [2023-08-29 20:51:16,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154867256637168 [2023-08-29 20:51:16,086 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 233 transitions. [2023-08-29 20:51:16,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 233 transitions. [2023-08-29 20:51:16,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:16,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 233 transitions. [2023-08-29 20:51:16,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:16,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 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-29 20:51:16,098 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 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-29 20:51:16,099 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 69 flow. Second operand 2 states and 233 transitions. [2023-08-29 20:51:16,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 103 flow [2023-08-29 20:51:16,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:51:16,103 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow [2023-08-29 20:51:16,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-08-29 20:51:16,106 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2023-08-29 20:51:16,106 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow [2023-08-29 20:51:16,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 102.5) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:16,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:16,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:16,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:51:16,109 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:16,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:16,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1057582066, now seen corresponding path program 1 times [2023-08-29 20:51:16,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:16,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700994263] [2023-08-29 20:51:16,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:16,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:16,379 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-29 20:51:16,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:16,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700994263] [2023-08-29 20:51:16,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700994263] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:16,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:16,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:51:16,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919220721] [2023-08-29 20:51:16,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:16,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:51:16,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:16,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:51:16,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:51:16,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 226 [2023-08-29 20:51:16,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:16,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:16,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 226 [2023-08-29 20:51:16,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:16,675 INFO L130 PetriNetUnfolder]: 1331/2108 cut-off events. [2023-08-29 20:51:16,675 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:16,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4133 conditions, 2108 events. 1331/2108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10203 event pairs, 287 based on Foata normal form. 0/1916 useless extension candidates. Maximal degree in co-relation 4130. Up to 1477 conditions per place. [2023-08-29 20:51:16,683 INFO L137 encePairwiseOnDemand]: 223/226 looper letters, 31 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-08-29 20:51:16,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 36 transitions, 148 flow [2023-08-29 20:51:16,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:51:16,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:51:16,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2023-08-29 20:51:16,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-29 20:51:16,686 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2023-08-29 20:51:16,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2023-08-29 20:51:16,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:16,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2023-08-29 20:51:16,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:16,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:16,689 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:16,689 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 339 transitions. [2023-08-29 20:51:16,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 36 transitions, 148 flow [2023-08-29 20:51:16,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 148 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:51:16,690 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-08-29 20:51:16,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-08-29 20:51:16,691 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2023-08-29 20:51:16,691 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-08-29 20:51:16,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:16,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:16,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:16,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:51:16,692 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:16,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:16,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1570835052, now seen corresponding path program 1 times [2023-08-29 20:51:16,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:16,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980946751] [2023-08-29 20:51:16,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:16,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:17,085 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-29 20:51:17,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:17,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980946751] [2023-08-29 20:51:17,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980946751] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:17,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:17,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:51:17,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101870720] [2023-08-29 20:51:17,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:17,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:51:17,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:17,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:51:17,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:51:17,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 226 [2023-08-29 20:51:17,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:17,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:17,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 226 [2023-08-29 20:51:17,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:17,472 INFO L130 PetriNetUnfolder]: 1700/2537 cut-off events. [2023-08-29 20:51:17,472 INFO L131 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2023-08-29 20:51:17,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5269 conditions, 2537 events. 1700/2537 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 11807 event pairs, 304 based on Foata normal form. 0/2429 useless extension candidates. Maximal degree in co-relation 5265. Up to 1980 conditions per place. [2023-08-29 20:51:17,480 INFO L137 encePairwiseOnDemand]: 214/226 looper letters, 39 selfloop transitions, 13 changer transitions 0/52 dead transitions. [2023-08-29 20:51:17,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 52 transitions, 226 flow [2023-08-29 20:51:17,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:51:17,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:51:17,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 426 transitions. [2023-08-29 20:51:17,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47123893805309736 [2023-08-29 20:51:17,483 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 426 transitions. [2023-08-29 20:51:17,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 426 transitions. [2023-08-29 20:51:17,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:17,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 426 transitions. [2023-08-29 20:51:17,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.5) internal successors, (426), 4 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-29 20:51:17,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:17,487 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:17,487 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 4 states and 426 transitions. [2023-08-29 20:51:17,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 52 transitions, 226 flow [2023-08-29 20:51:17,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 52 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:51:17,490 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 150 flow [2023-08-29 20:51:17,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2023-08-29 20:51:17,491 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2023-08-29 20:51:17,494 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 150 flow [2023-08-29 20:51:17,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:17,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:17,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:17,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:51:17,495 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:17,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:17,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1570835039, now seen corresponding path program 1 times [2023-08-29 20:51:17,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:17,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441877797] [2023-08-29 20:51:17,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:17,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:17,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:17,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:17,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441877797] [2023-08-29 20:51:17,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441877797] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:17,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:17,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:51:17,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698565396] [2023-08-29 20:51:17,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:17,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:51:17,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:17,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:51:17,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:51:17,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 226 [2023-08-29 20:51:17,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:17,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:17,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 226 [2023-08-29 20:51:17,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:18,061 INFO L130 PetriNetUnfolder]: 1172/1759 cut-off events. [2023-08-29 20:51:18,061 INFO L131 PetriNetUnfolder]: For 930/954 co-relation queries the response was YES. [2023-08-29 20:51:18,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5126 conditions, 1759 events. 1172/1759 cut-off events. For 930/954 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7690 event pairs, 241 based on Foata normal form. 138/1849 useless extension candidates. Maximal degree in co-relation 5120. Up to 1639 conditions per place. [2023-08-29 20:51:18,068 INFO L137 encePairwiseOnDemand]: 222/226 looper letters, 36 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2023-08-29 20:51:18,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 41 transitions, 248 flow [2023-08-29 20:51:18,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:51:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:51:18,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 467 transitions. [2023-08-29 20:51:18,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41327433628318583 [2023-08-29 20:51:18,070 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 467 transitions. [2023-08-29 20:51:18,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 467 transitions. [2023-08-29 20:51:18,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:18,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 467 transitions. [2023-08-29 20:51:18,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:18,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:18,074 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:18,074 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 150 flow. Second operand 5 states and 467 transitions. [2023-08-29 20:51:18,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 41 transitions, 248 flow [2023-08-29 20:51:18,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:51:18,077 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 126 flow [2023-08-29 20:51:18,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2023-08-29 20:51:18,077 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-08-29 20:51:18,077 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 126 flow [2023-08-29 20:51:18,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:18,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:18,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:18,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:51:18,078 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:18,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:18,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1469617673, now seen corresponding path program 1 times [2023-08-29 20:51:18,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:18,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440856609] [2023-08-29 20:51:18,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:18,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:18,352 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-29 20:51:18,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:18,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440856609] [2023-08-29 20:51:18,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440856609] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:18,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:18,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:51:18,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416481183] [2023-08-29 20:51:18,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:18,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:51:18,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:18,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:51:18,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:51:18,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 226 [2023-08-29 20:51:18,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:18,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:18,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 226 [2023-08-29 20:51:18,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:18,600 INFO L130 PetriNetUnfolder]: 1100/1648 cut-off events. [2023-08-29 20:51:18,600 INFO L131 PetriNetUnfolder]: For 528/528 co-relation queries the response was YES. [2023-08-29 20:51:18,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4741 conditions, 1648 events. 1100/1648 cut-off events. For 528/528 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6711 event pairs, 390 based on Foata normal form. 54/1702 useless extension candidates. Maximal degree in co-relation 4734. Up to 877 conditions per place. [2023-08-29 20:51:18,606 INFO L137 encePairwiseOnDemand]: 217/226 looper letters, 40 selfloop transitions, 10 changer transitions 0/50 dead transitions. [2023-08-29 20:51:18,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 302 flow [2023-08-29 20:51:18,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:51:18,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:51:18,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 413 transitions. [2023-08-29 20:51:18,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45685840707964603 [2023-08-29 20:51:18,607 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 413 transitions. [2023-08-29 20:51:18,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 413 transitions. [2023-08-29 20:51:18,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:18,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 413 transitions. [2023-08-29 20:51:18,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:18,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:18,611 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:18,611 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 126 flow. Second operand 4 states and 413 transitions. [2023-08-29 20:51:18,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 302 flow [2023-08-29 20:51:18,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 50 transitions, 296 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:51:18,613 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 206 flow [2023-08-29 20:51:18,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2023-08-29 20:51:18,614 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-08-29 20:51:18,614 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 206 flow [2023-08-29 20:51:18,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:18,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:18,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:18,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:51:18,615 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:18,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:18,615 INFO L85 PathProgramCache]: Analyzing trace with hash 864809579, now seen corresponding path program 1 times [2023-08-29 20:51:18,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:18,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773902666] [2023-08-29 20:51:18,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:18,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:19,155 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-29 20:51:19,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:19,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773902666] [2023-08-29 20:51:19,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773902666] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:19,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:19,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:51:19,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582204013] [2023-08-29 20:51:19,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:19,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:51:19,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:19,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:51:19,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:51:19,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 226 [2023-08-29 20:51:19,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 206 flow. Second operand has 7 states, 7 states have (on average 100.85714285714286) internal successors, (706), 7 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:19,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:19,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 226 [2023-08-29 20:51:19,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:19,431 INFO L130 PetriNetUnfolder]: 1110/1709 cut-off events. [2023-08-29 20:51:19,431 INFO L131 PetriNetUnfolder]: For 1122/1122 co-relation queries the response was YES. [2023-08-29 20:51:19,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5486 conditions, 1709 events. 1110/1709 cut-off events. For 1122/1122 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7456 event pairs, 91 based on Foata normal form. 18/1727 useless extension candidates. Maximal degree in co-relation 5477. Up to 1204 conditions per place. [2023-08-29 20:51:19,439 INFO L137 encePairwiseOnDemand]: 220/226 looper letters, 48 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2023-08-29 20:51:19,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 58 transitions, 397 flow [2023-08-29 20:51:19,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:51:19,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:51:19,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 440 transitions. [2023-08-29 20:51:19,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48672566371681414 [2023-08-29 20:51:19,442 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 440 transitions. [2023-08-29 20:51:19,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 440 transitions. [2023-08-29 20:51:19,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:19,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 440 transitions. [2023-08-29 20:51:19,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:19,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:19,444 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:19,444 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 206 flow. Second operand 4 states and 440 transitions. [2023-08-29 20:51:19,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 58 transitions, 397 flow [2023-08-29 20:51:19,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 58 transitions, 392 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:51:19,450 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 248 flow [2023-08-29 20:51:19,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=248, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2023-08-29 20:51:19,451 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2023-08-29 20:51:19,451 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 248 flow [2023-08-29 20:51:19,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.85714285714286) internal successors, (706), 7 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:19,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:19,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:19,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:51:19,452 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:19,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:19,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1553046503, now seen corresponding path program 1 times [2023-08-29 20:51:19,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:19,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708377304] [2023-08-29 20:51:19,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:19,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:20,137 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-29 20:51:20,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:20,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708377304] [2023-08-29 20:51:20,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708377304] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:20,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:20,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:51:20,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637800774] [2023-08-29 20:51:20,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:20,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:51:20,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:20,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:51:20,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:51:20,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 226 [2023-08-29 20:51:20,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 248 flow. Second operand has 7 states, 7 states have (on average 100.0) internal successors, (700), 7 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:20,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:20,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 226 [2023-08-29 20:51:20,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:20,484 INFO L130 PetriNetUnfolder]: 1379/2118 cut-off events. [2023-08-29 20:51:20,484 INFO L131 PetriNetUnfolder]: For 2431/2472 co-relation queries the response was YES. [2023-08-29 20:51:20,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7842 conditions, 2118 events. 1379/2118 cut-off events. For 2431/2472 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 9866 event pairs, 93 based on Foata normal form. 62/2180 useless extension candidates. Maximal degree in co-relation 7830. Up to 1250 conditions per place. [2023-08-29 20:51:20,496 INFO L137 encePairwiseOnDemand]: 217/226 looper letters, 60 selfloop transitions, 19 changer transitions 0/83 dead transitions. [2023-08-29 20:51:20,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 83 transitions, 626 flow [2023-08-29 20:51:20,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:51:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:51:20,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 544 transitions. [2023-08-29 20:51:20,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4814159292035398 [2023-08-29 20:51:20,498 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 544 transitions. [2023-08-29 20:51:20,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 544 transitions. [2023-08-29 20:51:20,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:20,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 544 transitions. [2023-08-29 20:51:20,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:20,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:20,501 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:20,501 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 248 flow. Second operand 5 states and 544 transitions. [2023-08-29 20:51:20,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 83 transitions, 626 flow [2023-08-29 20:51:20,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 83 transitions, 622 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:51:20,508 INFO L231 Difference]: Finished difference. Result has 50 places, 54 transitions, 422 flow [2023-08-29 20:51:20,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=422, PETRI_PLACES=50, PETRI_TRANSITIONS=54} [2023-08-29 20:51:20,508 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2023-08-29 20:51:20,508 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 54 transitions, 422 flow [2023-08-29 20:51:20,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.0) internal successors, (700), 7 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:20,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:20,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:20,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:51:20,509 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:20,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:20,510 INFO L85 PathProgramCache]: Analyzing trace with hash -260202353, now seen corresponding path program 2 times [2023-08-29 20:51:20,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:20,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025689895] [2023-08-29 20:51:20,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:20,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:21,193 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-29 20:51:21,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:21,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025689895] [2023-08-29 20:51:21,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025689895] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:21,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:21,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:51:21,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420847218] [2023-08-29 20:51:21,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:21,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:51:21,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:21,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:51:21,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:51:21,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 226 [2023-08-29 20:51:21,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 54 transitions, 422 flow. Second operand has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:21,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:21,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 226 [2023-08-29 20:51:21,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:21,773 INFO L130 PetriNetUnfolder]: 1656/2551 cut-off events. [2023-08-29 20:51:21,774 INFO L131 PetriNetUnfolder]: For 4881/4930 co-relation queries the response was YES. [2023-08-29 20:51:21,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11349 conditions, 2551 events. 1656/2551 cut-off events. For 4881/4930 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 12407 event pairs, 59 based on Foata normal form. 50/2590 useless extension candidates. Maximal degree in co-relation 11335. Up to 1543 conditions per place. [2023-08-29 20:51:21,795 INFO L137 encePairwiseOnDemand]: 216/226 looper letters, 82 selfloop transitions, 47 changer transitions 0/133 dead transitions. [2023-08-29 20:51:21,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 133 transitions, 1197 flow [2023-08-29 20:51:21,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:51:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:51:21,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 824 transitions. [2023-08-29 20:51:21,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4557522123893805 [2023-08-29 20:51:21,798 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 824 transitions. [2023-08-29 20:51:21,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 824 transitions. [2023-08-29 20:51:21,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:21,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 824 transitions. [2023-08-29 20:51:21,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 103.0) internal successors, (824), 8 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:21,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 226.0) internal successors, (2034), 9 states have internal predecessors, (2034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:21,802 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 226.0) internal successors, (2034), 9 states have internal predecessors, (2034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:21,802 INFO L175 Difference]: Start difference. First operand has 50 places, 54 transitions, 422 flow. Second operand 8 states and 824 transitions. [2023-08-29 20:51:21,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 133 transitions, 1197 flow [2023-08-29 20:51:21,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 133 transitions, 1166 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:51:21,818 INFO L231 Difference]: Finished difference. Result has 58 places, 88 transitions, 878 flow [2023-08-29 20:51:21,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=878, PETRI_PLACES=58, PETRI_TRANSITIONS=88} [2023-08-29 20:51:21,820 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2023-08-29 20:51:21,820 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 88 transitions, 878 flow [2023-08-29 20:51:21,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:21,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:21,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:21,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:51:21,821 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:21,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:21,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1551469223, now seen corresponding path program 3 times [2023-08-29 20:51:21,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:21,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645079228] [2023-08-29 20:51:21,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:21,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:22,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-29 20:51:22,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:22,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645079228] [2023-08-29 20:51:22,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645079228] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:22,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:22,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:51:22,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852885407] [2023-08-29 20:51:22,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:22,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:51:22,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:22,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:51:22,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:51:22,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 226 [2023-08-29 20:51:22,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 88 transitions, 878 flow. Second operand has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:22,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:22,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 226 [2023-08-29 20:51:22,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:22,631 INFO L130 PetriNetUnfolder]: 1825/2811 cut-off events. [2023-08-29 20:51:22,631 INFO L131 PetriNetUnfolder]: For 9065/9112 co-relation queries the response was YES. [2023-08-29 20:51:22,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14049 conditions, 2811 events. 1825/2811 cut-off events. For 9065/9112 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 14092 event pairs, 119 based on Foata normal form. 62/2868 useless extension candidates. Maximal degree in co-relation 14033. Up to 1901 conditions per place. [2023-08-29 20:51:22,645 INFO L137 encePairwiseOnDemand]: 217/226 looper letters, 89 selfloop transitions, 60 changer transitions 0/153 dead transitions. [2023-08-29 20:51:22,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 153 transitions, 1745 flow [2023-08-29 20:51:22,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:51:22,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:51:22,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 634 transitions. [2023-08-29 20:51:22,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46755162241887904 [2023-08-29 20:51:22,647 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 634 transitions. [2023-08-29 20:51:22,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 634 transitions. [2023-08-29 20:51:22,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:22,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 634 transitions. [2023-08-29 20:51:22,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:22,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:22,650 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:22,650 INFO L175 Difference]: Start difference. First operand has 58 places, 88 transitions, 878 flow. Second operand 6 states and 634 transitions. [2023-08-29 20:51:22,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 153 transitions, 1745 flow [2023-08-29 20:51:22,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 153 transitions, 1706 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-29 20:51:22,667 INFO L231 Difference]: Finished difference. Result has 63 places, 131 transitions, 1568 flow [2023-08-29 20:51:22,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1568, PETRI_PLACES=63, PETRI_TRANSITIONS=131} [2023-08-29 20:51:22,668 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 23 predicate places. [2023-08-29 20:51:22,668 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 131 transitions, 1568 flow [2023-08-29 20:51:22,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:22,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:22,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:22,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:51:22,669 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:22,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:22,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1503309173, now seen corresponding path program 4 times [2023-08-29 20:51:22,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:22,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643043338] [2023-08-29 20:51:22,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:22,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:23,247 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-29 20:51:23,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:23,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643043338] [2023-08-29 20:51:23,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643043338] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:23,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:23,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:51:23,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114015704] [2023-08-29 20:51:23,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:23,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:51:23,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:23,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:51:23,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:51:23,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 226 [2023-08-29 20:51:23,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 131 transitions, 1568 flow. Second operand has 8 states, 8 states have (on average 95.75) internal successors, (766), 8 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:23,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:23,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 226 [2023-08-29 20:51:23,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:23,940 INFO L130 PetriNetUnfolder]: 2666/4105 cut-off events. [2023-08-29 20:51:23,940 INFO L131 PetriNetUnfolder]: For 19972/20081 co-relation queries the response was YES. [2023-08-29 20:51:23,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23013 conditions, 4105 events. 2666/4105 cut-off events. For 19972/20081 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 22273 event pairs, 180 based on Foata normal form. 121/4204 useless extension candidates. Maximal degree in co-relation 22994. Up to 2422 conditions per place. [2023-08-29 20:51:23,960 INFO L137 encePairwiseOnDemand]: 217/226 looper letters, 124 selfloop transitions, 126 changer transitions 0/254 dead transitions. [2023-08-29 20:51:23,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 254 transitions, 3309 flow [2023-08-29 20:51:23,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:51:23,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:51:23,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 832 transitions. [2023-08-29 20:51:23,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46017699115044247 [2023-08-29 20:51:23,963 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 832 transitions. [2023-08-29 20:51:23,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 832 transitions. [2023-08-29 20:51:23,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:23,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 832 transitions. [2023-08-29 20:51:23,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 104.0) internal successors, (832), 8 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:23,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 226.0) internal successors, (2034), 9 states have internal predecessors, (2034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:23,968 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 226.0) internal successors, (2034), 9 states have internal predecessors, (2034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:23,968 INFO L175 Difference]: Start difference. First operand has 63 places, 131 transitions, 1568 flow. Second operand 8 states and 832 transitions. [2023-08-29 20:51:23,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 254 transitions, 3309 flow [2023-08-29 20:51:23,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 254 transitions, 3252 flow, removed 28 selfloop flow, removed 1 redundant places. [2023-08-29 20:51:23,996 INFO L231 Difference]: Finished difference. Result has 74 places, 187 transitions, 2710 flow [2023-08-29 20:51:23,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=1523, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2710, PETRI_PLACES=74, PETRI_TRANSITIONS=187} [2023-08-29 20:51:23,997 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 34 predicate places. [2023-08-29 20:51:23,997 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 187 transitions, 2710 flow [2023-08-29 20:51:23,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.75) internal successors, (766), 8 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:23,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:23,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:23,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:51:23,998 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:23,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:23,999 INFO L85 PathProgramCache]: Analyzing trace with hash -371430903, now seen corresponding path program 1 times [2023-08-29 20:51:23,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:23,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676201917] [2023-08-29 20:51:23,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:23,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:24,533 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-29 20:51:24,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:24,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676201917] [2023-08-29 20:51:24,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676201917] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:24,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:24,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:51:24,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937328751] [2023-08-29 20:51:24,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:24,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:51:24,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:24,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:51:24,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:51:24,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 226 [2023-08-29 20:51:24,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 187 transitions, 2710 flow. Second operand has 9 states, 9 states have (on average 97.66666666666667) internal successors, (879), 9 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:24,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:24,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 226 [2023-08-29 20:51:24,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:25,413 INFO L130 PetriNetUnfolder]: 3294/5127 cut-off events. [2023-08-29 20:51:25,413 INFO L131 PetriNetUnfolder]: For 35237/35263 co-relation queries the response was YES. [2023-08-29 20:51:25,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30609 conditions, 5127 events. 3294/5127 cut-off events. For 35237/35263 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 29543 event pairs, 184 based on Foata normal form. 82/5125 useless extension candidates. Maximal degree in co-relation 30585. Up to 2738 conditions per place. [2023-08-29 20:51:25,439 INFO L137 encePairwiseOnDemand]: 219/226 looper letters, 154 selfloop transitions, 91 changer transitions 49/298 dead transitions. [2023-08-29 20:51:25,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 298 transitions, 4462 flow [2023-08-29 20:51:25,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 20:51:25,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 20:51:25,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1052 transitions. [2023-08-29 20:51:25,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4654867256637168 [2023-08-29 20:51:25,442 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1052 transitions. [2023-08-29 20:51:25,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1052 transitions. [2023-08-29 20:51:25,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:25,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1052 transitions. [2023-08-29 20:51:25,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 105.2) internal successors, (1052), 10 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:25,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 226.0) internal successors, (2486), 11 states have internal predecessors, (2486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:25,447 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 226.0) internal successors, (2486), 11 states have internal predecessors, (2486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:25,447 INFO L175 Difference]: Start difference. First operand has 74 places, 187 transitions, 2710 flow. Second operand 10 states and 1052 transitions. [2023-08-29 20:51:25,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 298 transitions, 4462 flow [2023-08-29 20:51:25,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 298 transitions, 4410 flow, removed 26 selfloop flow, removed 0 redundant places. [2023-08-29 20:51:25,520 INFO L231 Difference]: Finished difference. Result has 88 places, 194 transitions, 3028 flow [2023-08-29 20:51:25,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=2682, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3028, PETRI_PLACES=88, PETRI_TRANSITIONS=194} [2023-08-29 20:51:25,520 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 48 predicate places. [2023-08-29 20:51:25,520 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 194 transitions, 3028 flow [2023-08-29 20:51:25,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 97.66666666666667) internal successors, (879), 9 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:25,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:25,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:25,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:51:25,522 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:25,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:25,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1451125637, now seen corresponding path program 1 times [2023-08-29 20:51:25,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:25,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476680593] [2023-08-29 20:51:25,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:25,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:25,650 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-29 20:51:25,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:25,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476680593] [2023-08-29 20:51:25,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476680593] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:25,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:25,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:51:25,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669890488] [2023-08-29 20:51:25,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:25,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:51:25,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:25,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:51:25,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:51:25,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 226 [2023-08-29 20:51:25,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 194 transitions, 3028 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:25,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:25,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 226 [2023-08-29 20:51:25,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:26,588 INFO L130 PetriNetUnfolder]: 3836/5959 cut-off events. [2023-08-29 20:51:26,604 INFO L131 PetriNetUnfolder]: For 51196/51196 co-relation queries the response was YES. [2023-08-29 20:51:26,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36627 conditions, 5959 events. 3836/5959 cut-off events. For 51196/51196 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 34873 event pairs, 1152 based on Foata normal form. 96/6055 useless extension candidates. Maximal degree in co-relation 36597. Up to 3142 conditions per place. [2023-08-29 20:51:26,640 INFO L137 encePairwiseOnDemand]: 223/226 looper letters, 208 selfloop transitions, 5 changer transitions 52/265 dead transitions. [2023-08-29 20:51:26,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 265 transitions, 4658 flow [2023-08-29 20:51:26,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:51:26,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:51:26,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2023-08-29 20:51:26,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4882005899705015 [2023-08-29 20:51:26,661 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 331 transitions. [2023-08-29 20:51:26,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 331 transitions. [2023-08-29 20:51:26,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:26,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 331 transitions. [2023-08-29 20:51:26,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:26,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:26,664 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:26,664 INFO L175 Difference]: Start difference. First operand has 88 places, 194 transitions, 3028 flow. Second operand 3 states and 331 transitions. [2023-08-29 20:51:26,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 265 transitions, 4658 flow [2023-08-29 20:51:26,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 265 transitions, 4460 flow, removed 84 selfloop flow, removed 3 redundant places. [2023-08-29 20:51:26,871 INFO L231 Difference]: Finished difference. Result has 88 places, 169 transitions, 2584 flow [2023-08-29 20:51:26,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=2908, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2584, PETRI_PLACES=88, PETRI_TRANSITIONS=169} [2023-08-29 20:51:26,879 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 48 predicate places. [2023-08-29 20:51:26,879 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 169 transitions, 2584 flow [2023-08-29 20:51:26,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:26,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:26,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:26,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:51:26,880 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:26,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:26,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1370897624, now seen corresponding path program 1 times [2023-08-29 20:51:26,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:26,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133608041] [2023-08-29 20:51:26,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:26,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:27,051 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-29 20:51:27,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:27,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133608041] [2023-08-29 20:51:27,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133608041] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:27,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:27,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:51:27,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196581224] [2023-08-29 20:51:27,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:27,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:51:27,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:27,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:51:27,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:51:27,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 226 [2023-08-29 20:51:27,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 169 transitions, 2584 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:27,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:27,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 226 [2023-08-29 20:51:27,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:27,322 INFO L130 PetriNetUnfolder]: 1177/1963 cut-off events. [2023-08-29 20:51:27,323 INFO L131 PetriNetUnfolder]: For 23357/23403 co-relation queries the response was YES. [2023-08-29 20:51:27,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11328 conditions, 1963 events. 1177/1963 cut-off events. For 23357/23403 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 10825 event pairs, 98 based on Foata normal form. 289/2251 useless extension candidates. Maximal degree in co-relation 11299. Up to 1124 conditions per place. [2023-08-29 20:51:27,332 INFO L137 encePairwiseOnDemand]: 220/226 looper letters, 160 selfloop transitions, 4 changer transitions 134/300 dead transitions. [2023-08-29 20:51:27,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 300 transitions, 5069 flow [2023-08-29 20:51:27,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:51:27,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:51:27,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2023-08-29 20:51:27,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48053097345132745 [2023-08-29 20:51:27,334 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 543 transitions. [2023-08-29 20:51:27,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 543 transitions. [2023-08-29 20:51:27,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:27,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 543 transitions. [2023-08-29 20:51:27,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:27,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:27,337 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:27,337 INFO L175 Difference]: Start difference. First operand has 88 places, 169 transitions, 2584 flow. Second operand 5 states and 543 transitions. [2023-08-29 20:51:27,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 300 transitions, 5069 flow [2023-08-29 20:51:27,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 300 transitions, 4939 flow, removed 18 selfloop flow, removed 9 redundant places. [2023-08-29 20:51:27,355 INFO L231 Difference]: Finished difference. Result has 86 places, 124 transitions, 1808 flow [2023-08-29 20:51:27,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=1732, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1808, PETRI_PLACES=86, PETRI_TRANSITIONS=124} [2023-08-29 20:51:27,356 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 46 predicate places. [2023-08-29 20:51:27,356 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 124 transitions, 1808 flow [2023-08-29 20:51:27,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:27,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:27,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:27,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:51:27,356 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:27,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:27,357 INFO L85 PathProgramCache]: Analyzing trace with hash -689928931, now seen corresponding path program 1 times [2023-08-29 20:51:27,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:27,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716165019] [2023-08-29 20:51:27,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:27,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:27,523 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-29 20:51:27,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:27,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716165019] [2023-08-29 20:51:27,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716165019] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:27,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:27,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:51:27,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188687761] [2023-08-29 20:51:27,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:27,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:51:27,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:27,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:51:27,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:51:27,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 226 [2023-08-29 20:51:27,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 124 transitions, 1808 flow. Second operand has 5 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:27,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:27,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 226 [2023-08-29 20:51:27,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:27,735 INFO L130 PetriNetUnfolder]: 563/1030 cut-off events. [2023-08-29 20:51:27,735 INFO L131 PetriNetUnfolder]: For 12565/12574 co-relation queries the response was YES. [2023-08-29 20:51:27,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6316 conditions, 1030 events. 563/1030 cut-off events. For 12565/12574 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5306 event pairs, 17 based on Foata normal form. 145/1174 useless extension candidates. Maximal degree in co-relation 6286. Up to 458 conditions per place. [2023-08-29 20:51:27,740 INFO L137 encePairwiseOnDemand]: 220/226 looper letters, 164 selfloop transitions, 7 changer transitions 64/237 dead transitions. [2023-08-29 20:51:27,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 237 transitions, 3822 flow [2023-08-29 20:51:27,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:51:27,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:51:27,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 649 transitions. [2023-08-29 20:51:27,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4786135693215339 [2023-08-29 20:51:27,742 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 649 transitions. [2023-08-29 20:51:27,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 649 transitions. [2023-08-29 20:51:27,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:27,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 649 transitions. [2023-08-29 20:51:27,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:27,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:27,745 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:27,745 INFO L175 Difference]: Start difference. First operand has 86 places, 124 transitions, 1808 flow. Second operand 6 states and 649 transitions. [2023-08-29 20:51:27,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 237 transitions, 3822 flow [2023-08-29 20:51:27,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 237 transitions, 3802 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-29 20:51:27,757 INFO L231 Difference]: Finished difference. Result has 89 places, 114 transitions, 1655 flow [2023-08-29 20:51:27,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=1579, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1655, PETRI_PLACES=89, PETRI_TRANSITIONS=114} [2023-08-29 20:51:27,758 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 49 predicate places. [2023-08-29 20:51:27,759 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 114 transitions, 1655 flow [2023-08-29 20:51:27,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:27,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:27,759 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-29 20:51:27,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:51:27,760 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:27,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:27,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1135764401, now seen corresponding path program 1 times [2023-08-29 20:51:27,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:27,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223403969] [2023-08-29 20:51:27,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:27,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:27,954 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-29 20:51:27,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:27,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223403969] [2023-08-29 20:51:27,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223403969] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:27,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:27,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:51:27,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686869617] [2023-08-29 20:51:27,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:27,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:51:27,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:27,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:51:27,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:51:27,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 226 [2023-08-29 20:51:27,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 114 transitions, 1655 flow. Second operand has 6 states, 6 states have (on average 100.0) internal successors, (600), 6 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:27,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:27,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 226 [2023-08-29 20:51:27,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:28,113 INFO L130 PetriNetUnfolder]: 327/629 cut-off events. [2023-08-29 20:51:28,113 INFO L131 PetriNetUnfolder]: For 6338/6341 co-relation queries the response was YES. [2023-08-29 20:51:28,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4157 conditions, 629 events. 327/629 cut-off events. For 6338/6341 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2999 event pairs, 12 based on Foata normal form. 37/665 useless extension candidates. Maximal degree in co-relation 4125. Up to 284 conditions per place. [2023-08-29 20:51:28,117 INFO L137 encePairwiseOnDemand]: 220/226 looper letters, 156 selfloop transitions, 10 changer transitions 21/189 dead transitions. [2023-08-29 20:51:28,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 189 transitions, 3070 flow [2023-08-29 20:51:28,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:51:28,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:51:28,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 735 transitions. [2023-08-29 20:51:28,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4646017699115044 [2023-08-29 20:51:28,120 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 735 transitions. [2023-08-29 20:51:28,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 735 transitions. [2023-08-29 20:51:28,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:28,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 735 transitions. [2023-08-29 20:51:28,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:28,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:28,124 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:28,124 INFO L175 Difference]: Start difference. First operand has 89 places, 114 transitions, 1655 flow. Second operand 7 states and 735 transitions. [2023-08-29 20:51:28,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 189 transitions, 3070 flow [2023-08-29 20:51:28,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 189 transitions, 2898 flow, removed 52 selfloop flow, removed 7 redundant places. [2023-08-29 20:51:28,135 INFO L231 Difference]: Finished difference. Result has 89 places, 109 transitions, 1499 flow [2023-08-29 20:51:28,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=1459, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1499, PETRI_PLACES=89, PETRI_TRANSITIONS=109} [2023-08-29 20:51:28,136 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 49 predicate places. [2023-08-29 20:51:28,136 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 109 transitions, 1499 flow [2023-08-29 20:51:28,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.0) internal successors, (600), 6 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:28,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:28,136 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] [2023-08-29 20:51:28,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:51:28,137 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:28,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:28,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1536809175, now seen corresponding path program 1 times [2023-08-29 20:51:28,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:28,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738257168] [2023-08-29 20:51:28,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:28,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:28,771 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-29 20:51:28,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:28,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738257168] [2023-08-29 20:51:28,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738257168] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:28,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:28,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:51:28,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49724281] [2023-08-29 20:51:28,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:28,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:51:28,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:28,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:51:28,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:51:28,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 226 [2023-08-29 20:51:28,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 109 transitions, 1499 flow. Second operand has 6 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:28,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:28,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 226 [2023-08-29 20:51:28,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:28,993 INFO L130 PetriNetUnfolder]: 317/607 cut-off events. [2023-08-29 20:51:28,994 INFO L131 PetriNetUnfolder]: For 4489/4496 co-relation queries the response was YES. [2023-08-29 20:51:28,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3862 conditions, 607 events. 317/607 cut-off events. For 4489/4496 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2850 event pairs, 41 based on Foata normal form. 8/615 useless extension candidates. Maximal degree in co-relation 3832. Up to 476 conditions per place. [2023-08-29 20:51:28,997 INFO L137 encePairwiseOnDemand]: 217/226 looper letters, 74 selfloop transitions, 31 changer transitions 24/131 dead transitions. [2023-08-29 20:51:28,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 131 transitions, 1994 flow [2023-08-29 20:51:28,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:51:28,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:51:28,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 629 transitions. [2023-08-29 20:51:28,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4638643067846608 [2023-08-29 20:51:28,999 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 629 transitions. [2023-08-29 20:51:28,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 629 transitions. [2023-08-29 20:51:28,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:28,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 629 transitions. [2023-08-29 20:51:29,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:29,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:29,003 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:29,003 INFO L175 Difference]: Start difference. First operand has 89 places, 109 transitions, 1499 flow. Second operand 6 states and 629 transitions. [2023-08-29 20:51:29,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 131 transitions, 1994 flow [2023-08-29 20:51:29,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 131 transitions, 1870 flow, removed 44 selfloop flow, removed 8 redundant places. [2023-08-29 20:51:29,013 INFO L231 Difference]: Finished difference. Result has 85 places, 100 transitions, 1370 flow [2023-08-29 20:51:29,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1370, PETRI_PLACES=85, PETRI_TRANSITIONS=100} [2023-08-29 20:51:29,014 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 45 predicate places. [2023-08-29 20:51:29,014 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 100 transitions, 1370 flow [2023-08-29 20:51:29,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:29,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:29,014 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] [2023-08-29 20:51:29,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:51:29,015 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:29,015 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:29,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1569020591, now seen corresponding path program 2 times [2023-08-29 20:51:29,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:29,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440202895] [2023-08-29 20:51:29,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:29,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:29,498 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-29 20:51:29,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:29,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440202895] [2023-08-29 20:51:29,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440202895] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:29,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:29,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:51:29,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084660839] [2023-08-29 20:51:29,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:29,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:51:29,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:29,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:51:29,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:51:29,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 226 [2023-08-29 20:51:29,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 100 transitions, 1370 flow. Second operand has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:29,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:29,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 226 [2023-08-29 20:51:29,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:29,884 INFO L130 PetriNetUnfolder]: 338/685 cut-off events. [2023-08-29 20:51:29,885 INFO L131 PetriNetUnfolder]: For 4667/4667 co-relation queries the response was YES. [2023-08-29 20:51:29,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4168 conditions, 685 events. 338/685 cut-off events. For 4667/4667 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3501 event pairs, 23 based on Foata normal form. 1/686 useless extension candidates. Maximal degree in co-relation 4142. Up to 459 conditions per place. [2023-08-29 20:51:29,888 INFO L137 encePairwiseOnDemand]: 215/226 looper letters, 71 selfloop transitions, 42 changer transitions 36/149 dead transitions. [2023-08-29 20:51:29,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 149 transitions, 2128 flow [2023-08-29 20:51:29,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:51:29,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:51:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 856 transitions. [2023-08-29 20:51:29,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42084562438544737 [2023-08-29 20:51:29,890 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 856 transitions. [2023-08-29 20:51:29,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 856 transitions. [2023-08-29 20:51:29,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:29,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 856 transitions. [2023-08-29 20:51:29,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.11111111111111) internal successors, (856), 9 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:29,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 226.0) internal successors, (2260), 10 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:29,894 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 226.0) internal successors, (2260), 10 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:29,895 INFO L175 Difference]: Start difference. First operand has 85 places, 100 transitions, 1370 flow. Second operand 9 states and 856 transitions. [2023-08-29 20:51:29,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 149 transitions, 2128 flow [2023-08-29 20:51:29,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 149 transitions, 2096 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-08-29 20:51:29,905 INFO L231 Difference]: Finished difference. Result has 91 places, 104 transitions, 1543 flow [2023-08-29 20:51:29,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=1344, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1543, PETRI_PLACES=91, PETRI_TRANSITIONS=104} [2023-08-29 20:51:29,906 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 51 predicate places. [2023-08-29 20:51:29,906 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 104 transitions, 1543 flow [2023-08-29 20:51:29,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:29,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:29,907 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] [2023-08-29 20:51:29,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 20:51:29,907 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:29,907 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:29,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1437443821, now seen corresponding path program 3 times [2023-08-29 20:51:29,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:29,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621814973] [2023-08-29 20:51:29,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:29,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:30,948 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-29 20:51:30,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:30,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621814973] [2023-08-29 20:51:30,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621814973] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:30,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:30,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 20:51:30,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732844053] [2023-08-29 20:51:30,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:30,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 20:51:30,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:30,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 20:51:30,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-08-29 20:51:31,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 226 [2023-08-29 20:51:31,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 104 transitions, 1543 flow. Second operand has 10 states, 10 states have (on average 99.0) internal successors, (990), 10 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:31,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:31,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 226 [2023-08-29 20:51:31,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:31,264 INFO L130 PetriNetUnfolder]: 335/688 cut-off events. [2023-08-29 20:51:31,264 INFO L131 PetriNetUnfolder]: For 5518/5524 co-relation queries the response was YES. [2023-08-29 20:51:31,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4383 conditions, 688 events. 335/688 cut-off events. For 5518/5524 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3580 event pairs, 94 based on Foata normal form. 4/691 useless extension candidates. Maximal degree in co-relation 4354. Up to 351 conditions per place. [2023-08-29 20:51:31,267 INFO L137 encePairwiseOnDemand]: 221/226 looper letters, 67 selfloop transitions, 2 changer transitions 78/150 dead transitions. [2023-08-29 20:51:31,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 150 transitions, 2386 flow [2023-08-29 20:51:31,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:51:31,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:51:31,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 625 transitions. [2023-08-29 20:51:31,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4609144542772861 [2023-08-29 20:51:31,271 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 625 transitions. [2023-08-29 20:51:31,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 625 transitions. [2023-08-29 20:51:31,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:31,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 625 transitions. [2023-08-29 20:51:31,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:31,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:31,274 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:31,274 INFO L175 Difference]: Start difference. First operand has 91 places, 104 transitions, 1543 flow. Second operand 6 states and 625 transitions. [2023-08-29 20:51:31,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 150 transitions, 2386 flow [2023-08-29 20:51:31,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 150 transitions, 2294 flow, removed 44 selfloop flow, removed 4 redundant places. [2023-08-29 20:51:31,287 INFO L231 Difference]: Finished difference. Result has 91 places, 72 transitions, 941 flow [2023-08-29 20:51:31,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=1477, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=941, PETRI_PLACES=91, PETRI_TRANSITIONS=72} [2023-08-29 20:51:31,287 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 51 predicate places. [2023-08-29 20:51:31,288 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 72 transitions, 941 flow [2023-08-29 20:51:31,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 99.0) internal successors, (990), 10 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:31,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:31,289 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] [2023-08-29 20:51:31,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 20:51:31,289 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:31,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:31,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1530558733, now seen corresponding path program 4 times [2023-08-29 20:51:31,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:31,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991525097] [2023-08-29 20:51:31,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:31,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:32,122 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-29 20:51:32,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:32,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991525097] [2023-08-29 20:51:32,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991525097] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:32,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:32,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:51:32,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39018463] [2023-08-29 20:51:32,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:32,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:51:32,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:32,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:51:32,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:51:32,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 226 [2023-08-29 20:51:32,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 72 transitions, 941 flow. Second operand has 9 states, 9 states have (on average 96.22222222222223) internal successors, (866), 9 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:32,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:32,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 226 [2023-08-29 20:51:32,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:32,375 INFO L130 PetriNetUnfolder]: 202/423 cut-off events. [2023-08-29 20:51:32,376 INFO L131 PetriNetUnfolder]: For 2821/2822 co-relation queries the response was YES. [2023-08-29 20:51:32,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2519 conditions, 423 events. 202/423 cut-off events. For 2821/2822 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1948 event pairs, 30 based on Foata normal form. 2/425 useless extension candidates. Maximal degree in co-relation 2491. Up to 246 conditions per place. [2023-08-29 20:51:32,377 INFO L137 encePairwiseOnDemand]: 221/226 looper letters, 38 selfloop transitions, 4 changer transitions 55/98 dead transitions. [2023-08-29 20:51:32,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 98 transitions, 1359 flow [2023-08-29 20:51:32,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:51:32,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:51:32,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 599 transitions. [2023-08-29 20:51:32,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.441740412979351 [2023-08-29 20:51:32,379 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 599 transitions. [2023-08-29 20:51:32,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 599 transitions. [2023-08-29 20:51:32,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:32,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 599 transitions. [2023-08-29 20:51:32,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:32,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:32,384 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:32,384 INFO L175 Difference]: Start difference. First operand has 91 places, 72 transitions, 941 flow. Second operand 6 states and 599 transitions. [2023-08-29 20:51:32,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 98 transitions, 1359 flow [2023-08-29 20:51:32,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 98 transitions, 1241 flow, removed 36 selfloop flow, removed 8 redundant places. [2023-08-29 20:51:32,392 INFO L231 Difference]: Finished difference. Result has 82 places, 39 transitions, 363 flow [2023-08-29 20:51:32,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=363, PETRI_PLACES=82, PETRI_TRANSITIONS=39} [2023-08-29 20:51:32,393 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 42 predicate places. [2023-08-29 20:51:32,393 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 39 transitions, 363 flow [2023-08-29 20:51:32,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 96.22222222222223) internal successors, (866), 9 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:32,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:32,394 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] [2023-08-29 20:51:32,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 20:51:32,394 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:32,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:32,394 INFO L85 PathProgramCache]: Analyzing trace with hash 633010607, now seen corresponding path program 5 times [2023-08-29 20:51:32,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:32,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264704065] [2023-08-29 20:51:32,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:32,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:33,394 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-29 20:51:33,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:33,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264704065] [2023-08-29 20:51:33,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264704065] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:33,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:33,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:51:33,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25475723] [2023-08-29 20:51:33,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:33,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:51:33,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:33,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:51:33,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:51:33,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 226 [2023-08-29 20:51:33,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 39 transitions, 363 flow. Second operand has 8 states, 8 states have (on average 100.5) internal successors, (804), 8 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:33,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:33,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 226 [2023-08-29 20:51:33,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:33,517 INFO L130 PetriNetUnfolder]: 62/145 cut-off events. [2023-08-29 20:51:33,517 INFO L131 PetriNetUnfolder]: For 672/672 co-relation queries the response was YES. [2023-08-29 20:51:33,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 802 conditions, 145 events. 62/145 cut-off events. For 672/672 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 465 event pairs, 13 based on Foata normal form. 1/146 useless extension candidates. Maximal degree in co-relation 776. Up to 79 conditions per place. [2023-08-29 20:51:33,518 INFO L137 encePairwiseOnDemand]: 220/226 looper letters, 30 selfloop transitions, 8 changer transitions 11/50 dead transitions. [2023-08-29 20:51:33,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 50 transitions, 529 flow [2023-08-29 20:51:33,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:51:33,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:51:33,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 520 transitions. [2023-08-29 20:51:33,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46017699115044247 [2023-08-29 20:51:33,520 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 520 transitions. [2023-08-29 20:51:33,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 520 transitions. [2023-08-29 20:51:33,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:33,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 520 transitions. [2023-08-29 20:51:33,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:33,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:33,524 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:33,524 INFO L175 Difference]: Start difference. First operand has 82 places, 39 transitions, 363 flow. Second operand 5 states and 520 transitions. [2023-08-29 20:51:33,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 50 transitions, 529 flow [2023-08-29 20:51:33,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 50 transitions, 406 flow, removed 37 selfloop flow, removed 21 redundant places. [2023-08-29 20:51:33,526 INFO L231 Difference]: Finished difference. Result has 63 places, 34 transitions, 227 flow [2023-08-29 20:51:33,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=63, PETRI_TRANSITIONS=34} [2023-08-29 20:51:33,527 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 23 predicate places. [2023-08-29 20:51:33,527 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 34 transitions, 227 flow [2023-08-29 20:51:33,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.5) internal successors, (804), 8 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:33,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:33,527 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] [2023-08-29 20:51:33,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 20:51:33,528 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:33,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:33,528 INFO L85 PathProgramCache]: Analyzing trace with hash 504936787, now seen corresponding path program 6 times [2023-08-29 20:51:33,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:33,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222441597] [2023-08-29 20:51:33,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:33,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:34,357 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-29 20:51:34,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:34,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222441597] [2023-08-29 20:51:34,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222441597] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:34,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:34,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:51:34,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755319242] [2023-08-29 20:51:34,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:34,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:51:34,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:34,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:51:34,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:51:34,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 226 [2023-08-29 20:51:34,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 34 transitions, 227 flow. Second operand has 9 states, 9 states have (on average 90.33333333333333) internal successors, (813), 9 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:34,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:34,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 226 [2023-08-29 20:51:34,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:34,633 INFO L130 PetriNetUnfolder]: 39/97 cut-off events. [2023-08-29 20:51:34,633 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2023-08-29 20:51:34,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 97 events. 39/97 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 228 event pairs, 8 based on Foata normal form. 1/98 useless extension candidates. Maximal degree in co-relation 431. Up to 47 conditions per place. [2023-08-29 20:51:34,634 INFO L137 encePairwiseOnDemand]: 219/226 looper letters, 28 selfloop transitions, 7 changer transitions 16/51 dead transitions. [2023-08-29 20:51:34,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 51 transitions, 427 flow [2023-08-29 20:51:34,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:51:34,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:51:34,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 828 transitions. [2023-08-29 20:51:34,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40707964601769914 [2023-08-29 20:51:34,636 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 828 transitions. [2023-08-29 20:51:34,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 828 transitions. [2023-08-29 20:51:34,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:34,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 828 transitions. [2023-08-29 20:51:34,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 92.0) internal successors, (828), 9 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:34,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 226.0) internal successors, (2260), 10 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:34,639 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 226.0) internal successors, (2260), 10 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:34,639 INFO L175 Difference]: Start difference. First operand has 63 places, 34 transitions, 227 flow. Second operand 9 states and 828 transitions. [2023-08-29 20:51:34,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 51 transitions, 427 flow [2023-08-29 20:51:34,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 51 transitions, 404 flow, removed 2 selfloop flow, removed 7 redundant places. [2023-08-29 20:51:34,643 INFO L231 Difference]: Finished difference. Result has 63 places, 29 transitions, 181 flow [2023-08-29 20:51:34,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=181, PETRI_PLACES=63, PETRI_TRANSITIONS=29} [2023-08-29 20:51:34,644 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 23 predicate places. [2023-08-29 20:51:34,644 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 29 transitions, 181 flow [2023-08-29 20:51:34,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 90.33333333333333) internal successors, (813), 9 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:34,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:34,644 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] [2023-08-29 20:51:34,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 20:51:34,645 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:34,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:34,645 INFO L85 PathProgramCache]: Analyzing trace with hash -586996739, now seen corresponding path program 7 times [2023-08-29 20:51:34,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:34,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756958039] [2023-08-29 20:51:34,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:34,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:51:34,678 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:51:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:51:34,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:51:34,747 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:51:34,748 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-29 20:51:34,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-29 20:51:34,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-29 20:51:34,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-29 20:51:34,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-29 20:51:34,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-29 20:51:34,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-29 20:51:34,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-29 20:51:34,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-29 20:51:34,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-29 20:51:34,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-29 20:51:34,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-29 20:51:34,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-29 20:51:34,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-29 20:51:34,754 INFO L445 BasicCegarLoop]: Path program histogram: [7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:34,759 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:51:34,760 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:51:34,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:51:34 BasicIcfg [2023-08-29 20:51:34,823 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:51:34,824 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:51:34,824 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:51:34,824 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:51:34,824 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:51:10" (3/4) ... [2023-08-29 20:51:34,826 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:51:34,826 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:51:34,826 INFO L158 Benchmark]: Toolchain (without parser) took 25429.39ms. Allocated memory was 73.4MB in the beginning and 826.3MB in the end (delta: 752.9MB). Free memory was 50.7MB in the beginning and 637.9MB in the end (delta: -587.2MB). Peak memory consumption was 170.3MB. Max. memory is 16.1GB. [2023-08-29 20:51:34,826 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 73.4MB. Free memory is still 52.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:51:34,827 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.93ms. Allocated memory was 73.4MB in the beginning and 104.9MB in the end (delta: 31.5MB). Free memory was 50.4MB in the beginning and 79.9MB in the end (delta: -29.4MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. [2023-08-29 20:51:34,827 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.70ms. Allocated memory is still 104.9MB. Free memory was 79.8MB in the beginning and 77.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 20:51:34,827 INFO L158 Benchmark]: Boogie Preprocessor took 39.70ms. Allocated memory is still 104.9MB. Free memory was 77.0MB in the beginning and 74.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:51:34,827 INFO L158 Benchmark]: RCFGBuilder took 629.12ms. Allocated memory is still 104.9MB. Free memory was 74.2MB in the beginning and 68.7MB in the end (delta: 5.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2023-08-29 20:51:34,827 INFO L158 Benchmark]: TraceAbstraction took 24198.22ms. Allocated memory was 104.9MB in the beginning and 826.3MB in the end (delta: 721.4MB). Free memory was 68.1MB in the beginning and 637.9MB in the end (delta: -569.8MB). Peak memory consumption was 152.6MB. Max. memory is 16.1GB. [2023-08-29 20:51:34,827 INFO L158 Benchmark]: Witness Printer took 2.21ms. Allocated memory is still 826.3MB. Free memory is still 637.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:51:34,828 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.14ms. Allocated memory is still 73.4MB. Free memory is still 52.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 495.93ms. Allocated memory was 73.4MB in the beginning and 104.9MB in the end (delta: 31.5MB). Free memory was 50.4MB in the beginning and 79.9MB in the end (delta: -29.4MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.70ms. Allocated memory is still 104.9MB. Free memory was 79.8MB in the beginning and 77.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.70ms. Allocated memory is still 104.9MB. Free memory was 77.0MB in the beginning and 74.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 629.12ms. Allocated memory is still 104.9MB. Free memory was 74.2MB in the beginning and 68.7MB in the end (delta: 5.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 24198.22ms. Allocated memory was 104.9MB in the beginning and 826.3MB in the end (delta: 721.4MB). Free memory was 68.1MB in the beginning and 637.9MB in the end (delta: -569.8MB). Peak memory consumption was 152.6MB. Max. memory is 16.1GB. * Witness Printer took 2.21ms. Allocated memory is still 826.3MB. Free memory is still 637.9MB. 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.7s, 122 PlacesBefore, 40 PlacesAfterwards, 114 TransitionsBefore, 30 TransitionsAfterwards, 2088 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 109 TotalNumberOfCompositions, 5887 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2436, independent: 2247, independent conditional: 0, independent unconditional: 2247, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1132, independent: 1082, independent conditional: 0, independent unconditional: 1082, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2436, independent: 1165, independent conditional: 0, independent unconditional: 1165, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 1132, unknown conditional: 0, unknown unconditional: 1132] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 63, Positive conditional cache size: 0, Positive unconditional cache size: 63, 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: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2537, ((void *)0), P0, ((void *)0))=-2, t2537={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2538, ((void *)0), P1, ((void *)0))=-1, t2537={5:0}, t2538={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2539, ((void *)0), P2, ((void *)0))=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L772] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 852]: 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: 850]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 144 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.0s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1219 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 966 mSDsluCounter, 994 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 874 mSDsCounter, 548 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2948 IncrementalHoareTripleChecker+Invalid, 3496 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 548 mSolverCounterUnsat, 120 mSDtfsCounter, 2948 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3028occurred in iteration=11, InterpolantAutomatonStates: 121, 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, 9.5s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 3936 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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-29 20:51:34,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:51:36,442 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:51:36,443 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:51:36,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:51:36,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:51:36,480 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:51:36,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:51:36,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:51:36,486 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:51:36,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:51:36,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:51:36,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:51:36,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:51:36,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:51:36,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:51:36,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:51:36,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:51:36,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:51:36,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:51:36,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:51:36,513 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:51:36,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:51:36,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:51:36,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:51:36,520 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:51:36,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:51:36,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:51:36,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:51:36,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:51:36,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:51:36,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:51:36,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:51:36,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:51:36,526 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:51:36,527 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:51:36,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:51:36,528 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:51:36,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:51:36,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:51:36,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:51:36,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:51:36,530 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 20:51:36,555 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:51:36,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:51:36,556 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:51:36,556 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:51:36,557 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:51:36,557 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:51:36,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:51:36,558 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:51:36,558 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:51:36,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:51:36,559 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:51:36,559 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:51:36,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:51:36,559 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:51:36,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:51:36,559 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:51:36,560 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:51:36,560 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:51:36,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:51:36,560 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:51:36,560 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:51:36,560 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:51:36,560 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:51:36,561 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:51:36,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:51:36,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:51:36,561 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:51:36,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:51:36,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:51:36,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:51:36,562 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:51:36,562 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:51:36,562 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:51:36,562 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:51:36,562 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:51:36,563 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:51:36,563 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:51:36,563 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 -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 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 -> AFTER [2023-08-29 20:51:36,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:51:36,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:51:36,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:51:36,805 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:51:36,806 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:51:36,807 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-29 20:51:37,834 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:51:38,087 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:51:38,088 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-29 20:51:38,105 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c82167eac/73f18c4a3696488abd5bf13c4ccfba6a/FLAG39578b60a [2023-08-29 20:51:38,129 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c82167eac/73f18c4a3696488abd5bf13c4ccfba6a [2023-08-29 20:51:38,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:51:38,132 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:51:38,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:51:38,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:51:38,136 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:51:38,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:51:38" (1/1) ... [2023-08-29 20:51:38,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a26155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:38, skipping insertion in model container [2023-08-29 20:51:38,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:51:38" (1/1) ... [2023-08-29 20:51:38,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:51:38,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:51:38,312 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-08-29 20:51:38,484 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:51:38,497 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:51:38,505 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-08-29 20:51:38,566 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:51:38,603 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:51:38,604 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:51:38,608 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:51:38,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:38 WrapperNode [2023-08-29 20:51:38,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:51:38,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:51:38,609 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:51:38,609 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:51:38,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:38" (1/1) ... [2023-08-29 20:51:38,639 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:38" (1/1) ... [2023-08-29 20:51:38,667 INFO L138 Inliner]: procedures = 179, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-29 20:51:38,668 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:51:38,669 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:51:38,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:51:38,669 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:51:38,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:38" (1/1) ... [2023-08-29 20:51:38,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:38" (1/1) ... [2023-08-29 20:51:38,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:38" (1/1) ... [2023-08-29 20:51:38,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:38" (1/1) ... [2023-08-29 20:51:38,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:38" (1/1) ... [2023-08-29 20:51:38,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:38" (1/1) ... [2023-08-29 20:51:38,707 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:38" (1/1) ... [2023-08-29 20:51:38,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:38" (1/1) ... [2023-08-29 20:51:38,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:51:38,715 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:51:38,715 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:51:38,715 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:51:38,716 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:38" (1/1) ... [2023-08-29 20:51:38,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:51:38,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:51:38,735 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-29 20:51:38,754 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-29 20:51:38,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:51:38,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:51:38,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:51:38,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:51:38,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:51:38,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:51:38,761 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:51:38,761 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:51:38,762 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:51:38,762 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:51:38,762 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:51:38,762 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:51:38,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:51:38,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:51:38,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:51:38,763 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:51:38,921 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:51:38,930 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:51:39,242 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:51:39,347 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:51:39,348 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:51:39,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:51:39 BoogieIcfgContainer [2023-08-29 20:51:39,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:51:39,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:51:39,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:51:39,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:51:39,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:51:38" (1/3) ... [2023-08-29 20:51:39,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e72e775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:51:39, skipping insertion in model container [2023-08-29 20:51:39,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:38" (2/3) ... [2023-08-29 20:51:39,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e72e775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:51:39, skipping insertion in model container [2023-08-29 20:51:39,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:51:39" (3/3) ... [2023-08-29 20:51:39,354 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-29 20:51:39,364 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:51:39,364 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-29 20:51:39,364 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:51:39,428 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:51:39,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 251 flow [2023-08-29 20:51:39,500 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2023-08-29 20:51:39,500 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:39,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-29 20:51:39,505 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 118 transitions, 251 flow [2023-08-29 20:51:39,508 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 115 transitions, 239 flow [2023-08-29 20:51:39,511 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:51:39,521 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 115 transitions, 239 flow [2023-08-29 20:51:39,524 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 115 transitions, 239 flow [2023-08-29 20:51:39,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 239 flow [2023-08-29 20:51:39,549 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2023-08-29 20:51:39,550 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:39,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-29 20:51:39,552 INFO L119 LiptonReduction]: Number of co-enabled transitions 2088 [2023-08-29 20:51:44,027 INFO L134 LiptonReduction]: Checked pairs total: 5683 [2023-08-29 20:51:44,028 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-08-29 20:51:44,037 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:51:44,040 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;@338d63d3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:51:44,040 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-29 20:51:44,042 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:51:44,042 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:44,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:44,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:51:44,043 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:44,046 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:44,046 INFO L85 PathProgramCache]: Analyzing trace with hash 585, now seen corresponding path program 1 times [2023-08-29 20:51:44,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:44,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29069625] [2023-08-29 20:51:44,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:44,053 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-29 20:51:44,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:44,056 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-29 20:51:44,057 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-29 20:51:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:44,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:51:44,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:44,108 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-29 20:51:44,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:44,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:44,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29069625] [2023-08-29 20:51:44,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29069625] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:44,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:44,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:51:44,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135168450] [2023-08-29 20:51:44,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:44,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:51:44,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:44,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:51:44,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:51:44,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 233 [2023-08-29 20:51:44,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 103.5) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:44,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:44,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 233 [2023-08-29 20:51:44,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:44,535 INFO L130 PetriNetUnfolder]: 2251/3304 cut-off events. [2023-08-29 20:51:44,535 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2023-08-29 20:51:44,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6635 conditions, 3304 events. 2251/3304 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 15430 event pairs, 2251 based on Foata normal form. 120/2848 useless extension candidates. Maximal degree in co-relation 6624. Up to 3269 conditions per place. [2023-08-29 20:51:44,548 INFO L137 encePairwiseOnDemand]: 226/233 looper letters, 25 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-08-29 20:51:44,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 111 flow [2023-08-29 20:51:44,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:51:44,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:51:44,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 238 transitions. [2023-08-29 20:51:44,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5107296137339056 [2023-08-29 20:51:44,558 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 238 transitions. [2023-08-29 20:51:44,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 238 transitions. [2023-08-29 20:51:44,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:44,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 238 transitions. [2023-08-29 20:51:44,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:44,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 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-29 20:51:44,565 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 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-29 20:51:44,566 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 238 transitions. [2023-08-29 20:51:44,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 111 flow [2023-08-29 20:51:44,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:51:44,569 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2023-08-29 20:51:44,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-08-29 20:51:44,572 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-08-29 20:51:44,573 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2023-08-29 20:51:44,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 103.5) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:44,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:44,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:44,597 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 (2)] Ended with exit code 0 [2023-08-29 20:51:44,779 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-29 20:51:44,780 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:44,780 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:44,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1263416957, now seen corresponding path program 1 times [2023-08-29 20:51:44,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:44,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742758737] [2023-08-29 20:51:44,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:44,782 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-29 20:51:44,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:44,783 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-29 20:51:44,785 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-29 20:51:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:44,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:51:44,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:44,889 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-29 20:51:44,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:44,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:44,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742758737] [2023-08-29 20:51:44,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742758737] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:44,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:44,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:51:44,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045243375] [2023-08-29 20:51:44,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:44,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:51:44,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:44,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:51:44,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:51:44,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 233 [2023-08-29 20:51:44,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:44,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:44,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 233 [2023-08-29 20:51:44,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:45,255 INFO L130 PetriNetUnfolder]: 1779/2796 cut-off events. [2023-08-29 20:51:45,256 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:45,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5461 conditions, 2796 events. 1779/2796 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14083 event pairs, 363 based on Foata normal form. 0/2508 useless extension candidates. Maximal degree in co-relation 5458. Up to 1993 conditions per place. [2023-08-29 20:51:45,263 INFO L137 encePairwiseOnDemand]: 230/233 looper letters, 33 selfloop transitions, 2 changer transitions 4/40 dead transitions. [2023-08-29 20:51:45,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 164 flow [2023-08-29 20:51:45,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:51:45,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:51:45,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-08-29 20:51:45,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4949928469241774 [2023-08-29 20:51:45,268 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-08-29 20:51:45,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-08-29 20:51:45,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:45,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-08-29 20:51:45,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:45,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:45,274 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:45,274 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 346 transitions. [2023-08-29 20:51:45,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 164 flow [2023-08-29 20:51:45,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 40 transitions, 164 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:51:45,275 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 56 flow [2023-08-29 20:51:45,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-08-29 20:51:45,276 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2023-08-29 20:51:45,276 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 56 flow [2023-08-29 20:51:45,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:45,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:45,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:45,286 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-29 20:51:45,483 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-29 20:51:45,484 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:45,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:45,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1654735517, now seen corresponding path program 1 times [2023-08-29 20:51:45,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:45,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778202989] [2023-08-29 20:51:45,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:45,485 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-29 20:51:45,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:45,486 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-29 20:51:45,490 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-29 20:51:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:45,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:51:45,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:45,607 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-29 20:51:45,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:45,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:45,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778202989] [2023-08-29 20:51:45,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778202989] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:45,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:45,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:51:45,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375950224] [2023-08-29 20:51:45,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:45,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:51:45,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:45,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:51:45,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:51:45,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 233 [2023-08-29 20:51:45,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:45,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:45,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 233 [2023-08-29 20:51:45,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:45,834 INFO L130 PetriNetUnfolder]: 829/1342 cut-off events. [2023-08-29 20:51:45,835 INFO L131 PetriNetUnfolder]: For 87/87 co-relation queries the response was YES. [2023-08-29 20:51:45,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2831 conditions, 1342 events. 829/1342 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6051 event pairs, 167 based on Foata normal form. 96/1384 useless extension candidates. Maximal degree in co-relation 2827. Up to 883 conditions per place. [2023-08-29 20:51:45,838 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 33 selfloop transitions, 4 changer transitions 23/61 dead transitions. [2023-08-29 20:51:45,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 61 transitions, 262 flow [2023-08-29 20:51:45,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:51:45,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:51:45,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 552 transitions. [2023-08-29 20:51:45,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738197424892704 [2023-08-29 20:51:45,841 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 552 transitions. [2023-08-29 20:51:45,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 552 transitions. [2023-08-29 20:51:45,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:45,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 552 transitions. [2023-08-29 20:51:45,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:45,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:45,845 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:45,845 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 56 flow. Second operand 5 states and 552 transitions. [2023-08-29 20:51:45,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 61 transitions, 262 flow [2023-08-29 20:51:45,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 61 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:51:45,848 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 88 flow [2023-08-29 20:51:45,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-08-29 20:51:45,849 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2023-08-29 20:51:45,849 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 88 flow [2023-08-29 20:51:45,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:45,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:45,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:45,857 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-29 20:51:46,056 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-29 20:51:46,057 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:46,060 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:46,060 INFO L85 PathProgramCache]: Analyzing trace with hash 368577673, now seen corresponding path program 1 times [2023-08-29 20:51:46,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:46,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323776870] [2023-08-29 20:51:46,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:46,062 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-29 20:51:46,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:46,063 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-29 20:51:46,065 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-29 20:51:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:46,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:51:46,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:46,155 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-29 20:51:46,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:46,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:46,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323776870] [2023-08-29 20:51:46,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323776870] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:46,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:46,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:51:46,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869710257] [2023-08-29 20:51:46,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:46,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:51:46,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:46,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:51:46,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:51:46,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 233 [2023-08-29 20:51:46,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:46,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:46,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 233 [2023-08-29 20:51:46,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:46,339 INFO L130 PetriNetUnfolder]: 343/616 cut-off events. [2023-08-29 20:51:46,340 INFO L131 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2023-08-29 20:51:46,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1616 conditions, 616 events. 343/616 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2488 event pairs, 105 based on Foata normal form. 51/652 useless extension candidates. Maximal degree in co-relation 1609. Up to 182 conditions per place. [2023-08-29 20:51:46,342 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 43 selfloop transitions, 7 changer transitions 23/74 dead transitions. [2023-08-29 20:51:46,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 74 transitions, 374 flow [2023-08-29 20:51:46,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:51:46,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:51:46,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 663 transitions. [2023-08-29 20:51:46,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742489270386266 [2023-08-29 20:51:46,344 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 663 transitions. [2023-08-29 20:51:46,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 663 transitions. [2023-08-29 20:51:46,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:46,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 663 transitions. [2023-08-29 20:51:46,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:46,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:46,348 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:46,348 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 88 flow. Second operand 6 states and 663 transitions. [2023-08-29 20:51:46,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 74 transitions, 374 flow [2023-08-29 20:51:46,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 74 transitions, 368 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:51:46,350 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 138 flow [2023-08-29 20:51:46,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-29 20:51:46,351 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2023-08-29 20:51:46,351 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 138 flow [2023-08-29 20:51:46,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:46,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:46,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:46,361 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-29 20:51:46,559 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-29 20:51:46,559 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:46,559 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:46,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1281642858, now seen corresponding path program 1 times [2023-08-29 20:51:46,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:46,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051097060] [2023-08-29 20:51:46,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:46,561 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-29 20:51:46,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:46,562 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-29 20:51:46,564 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-29 20:51:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:46,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:51:46,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:46,705 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-29 20:51:46,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:46,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:46,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051097060] [2023-08-29 20:51:46,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051097060] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:46,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:46,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:51:46,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181982480] [2023-08-29 20:51:46,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:46,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:51:46,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:46,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:51:46,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:51:46,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 233 [2023-08-29 20:51:46,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:46,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:46,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 233 [2023-08-29 20:51:46,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:46,941 INFO L130 PetriNetUnfolder]: 221/400 cut-off events. [2023-08-29 20:51:46,941 INFO L131 PetriNetUnfolder]: For 336/336 co-relation queries the response was YES. [2023-08-29 20:51:46,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1129 conditions, 400 events. 221/400 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1477 event pairs, 100 based on Foata normal form. 12/408 useless extension candidates. Maximal degree in co-relation 1120. Up to 182 conditions per place. [2023-08-29 20:51:46,943 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 40 selfloop transitions, 10 changer transitions 12/63 dead transitions. [2023-08-29 20:51:46,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 364 flow [2023-08-29 20:51:46,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:51:46,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:51:46,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 750 transitions. [2023-08-29 20:51:46,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4598405885959534 [2023-08-29 20:51:46,945 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 750 transitions. [2023-08-29 20:51:46,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 750 transitions. [2023-08-29 20:51:46,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:46,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 750 transitions. [2023-08-29 20:51:46,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.14285714285714) internal successors, (750), 7 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:46,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:46,949 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:46,949 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 138 flow. Second operand 7 states and 750 transitions. [2023-08-29 20:51:46,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 63 transitions, 364 flow [2023-08-29 20:51:46,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 63 transitions, 328 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-29 20:51:46,952 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 140 flow [2023-08-29 20:51:46,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2023-08-29 20:51:46,953 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2023-08-29 20:51:46,953 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 140 flow [2023-08-29 20:51:46,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:46,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:46,954 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-29 20:51:46,979 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 (6)] Ended with exit code 0 [2023-08-29 20:51:47,154 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-29 20:51:47,155 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:47,155 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:47,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1835720118, now seen corresponding path program 1 times [2023-08-29 20:51:47,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:47,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369614012] [2023-08-29 20:51:47,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:47,156 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-29 20:51:47,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:47,161 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-29 20:51:47,162 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-29 20:51:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:47,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:51:47,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:47,342 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-29 20:51:47,342 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:47,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:47,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [369614012] [2023-08-29 20:51:47,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [369614012] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:47,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:47,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:51:47,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558503293] [2023-08-29 20:51:47,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:47,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:51:47,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:47,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:51:47,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:51:47,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 233 [2023-08-29 20:51:47,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:47,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:47,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 233 [2023-08-29 20:51:47,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:47,516 INFO L130 PetriNetUnfolder]: 312/552 cut-off events. [2023-08-29 20:51:47,516 INFO L131 PetriNetUnfolder]: For 554/554 co-relation queries the response was YES. [2023-08-29 20:51:47,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1575 conditions, 552 events. 312/552 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2155 event pairs, 171 based on Foata normal form. 0/551 useless extension candidates. Maximal degree in co-relation 1565. Up to 381 conditions per place. [2023-08-29 20:51:47,518 INFO L137 encePairwiseOnDemand]: 229/233 looper letters, 46 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2023-08-29 20:51:47,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 350 flow [2023-08-29 20:51:47,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:51:47,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:51:47,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2023-08-29 20:51:47,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4656652360515021 [2023-08-29 20:51:47,520 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 434 transitions. [2023-08-29 20:51:47,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 434 transitions. [2023-08-29 20:51:47,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:47,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 434 transitions. [2023-08-29 20:51:47,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:47,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:47,523 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:47,523 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 140 flow. Second operand 4 states and 434 transitions. [2023-08-29 20:51:47,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 350 flow [2023-08-29 20:51:47,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 276 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-08-29 20:51:47,525 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 122 flow [2023-08-29 20:51:47,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-08-29 20:51:47,527 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2023-08-29 20:51:47,527 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 122 flow [2023-08-29 20:51:47,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:47,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:47,527 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-29 20:51:47,545 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-29 20:51:47,728 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-29 20:51:47,728 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:47,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:47,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1392935909, now seen corresponding path program 1 times [2023-08-29 20:51:47,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:47,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664584693] [2023-08-29 20:51:47,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:47,729 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-29 20:51:47,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:47,730 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-29 20:51:47,733 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-29 20:51:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:47,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-29 20:51:47,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:48,146 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-29 20:51:48,147 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:48,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:48,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664584693] [2023-08-29 20:51:48,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664584693] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:48,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:48,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:51:48,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847199292] [2023-08-29 20:51:48,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:48,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:51:48,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:48,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:51:48,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:51:48,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 233 [2023-08-29 20:51:48,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:48,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:48,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 233 [2023-08-29 20:51:48,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:48,535 INFO L130 PetriNetUnfolder]: 280/518 cut-off events. [2023-08-29 20:51:48,536 INFO L131 PetriNetUnfolder]: For 323/323 co-relation queries the response was YES. [2023-08-29 20:51:48,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 518 events. 280/518 cut-off events. For 323/323 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2177 event pairs, 30 based on Foata normal form. 2/520 useless extension candidates. Maximal degree in co-relation 1423. Up to 440 conditions per place. [2023-08-29 20:51:48,537 INFO L137 encePairwiseOnDemand]: 229/233 looper letters, 29 selfloop transitions, 3 changer transitions 10/43 dead transitions. [2023-08-29 20:51:48,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 254 flow [2023-08-29 20:51:48,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:51:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:51:48,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2023-08-29 20:51:48,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40171673819742487 [2023-08-29 20:51:48,539 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 468 transitions. [2023-08-29 20:51:48,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 468 transitions. [2023-08-29 20:51:48,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:48,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 468 transitions. [2023-08-29 20:51:48,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.6) internal successors, (468), 5 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:48,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:48,542 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:48,542 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 122 flow. Second operand 5 states and 468 transitions. [2023-08-29 20:51:48,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 254 flow [2023-08-29 20:51:48,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:51:48,544 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 114 flow [2023-08-29 20:51:48,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-08-29 20:51:48,545 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-08-29 20:51:48,545 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 114 flow [2023-08-29 20:51:48,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:48,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:48,545 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-29 20:51:48,569 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-29 20:51:48,769 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-29 20:51:48,770 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:48,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:48,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1680305380, now seen corresponding path program 2 times [2023-08-29 20:51:48,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:48,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963349245] [2023-08-29 20:51:48,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:51:48,771 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-29 20:51:48,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:48,798 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-29 20:51:48,799 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-29 20:51:48,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:51:48,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:51:48,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-29 20:51:48,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:49,018 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-29 20:51:49,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:49,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:49,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963349245] [2023-08-29 20:51:49,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963349245] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:49,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:49,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:51:49,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564322190] [2023-08-29 20:51:49,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:49,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:51:49,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:49,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:51:49,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:51:49,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 233 [2023-08-29 20:51:49,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 114 flow. Second operand has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:49,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:49,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 233 [2023-08-29 20:51:49,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:49,297 INFO L130 PetriNetUnfolder]: 210/418 cut-off events. [2023-08-29 20:51:49,297 INFO L131 PetriNetUnfolder]: For 310/310 co-relation queries the response was YES. [2023-08-29 20:51:49,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1215 conditions, 418 events. 210/418 cut-off events. For 310/310 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1813 event pairs, 10 based on Foata normal form. 1/419 useless extension candidates. Maximal degree in co-relation 1206. Up to 202 conditions per place. [2023-08-29 20:51:49,299 INFO L137 encePairwiseOnDemand]: 222/233 looper letters, 43 selfloop transitions, 11 changer transitions 31/86 dead transitions. [2023-08-29 20:51:49,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 86 transitions, 530 flow [2023-08-29 20:51:49,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:51:49,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:51:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 820 transitions. [2023-08-29 20:51:49,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43991416309012876 [2023-08-29 20:51:49,301 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 820 transitions. [2023-08-29 20:51:49,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 820 transitions. [2023-08-29 20:51:49,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:49,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 820 transitions. [2023-08-29 20:51:49,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 102.5) internal successors, (820), 8 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:49,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:49,305 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:49,305 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 114 flow. Second operand 8 states and 820 transitions. [2023-08-29 20:51:49,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 86 transitions, 530 flow [2023-08-29 20:51:49,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 86 transitions, 511 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-29 20:51:49,309 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 174 flow [2023-08-29 20:51:49,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2023-08-29 20:51:49,311 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2023-08-29 20:51:49,311 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 174 flow [2023-08-29 20:51:49,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:49,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:49,313 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-29 20:51:49,336 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-29 20:51:49,521 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-29 20:51:49,521 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:49,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:49,525 INFO L85 PathProgramCache]: Analyzing trace with hash 638571256, now seen corresponding path program 3 times [2023-08-29 20:51:49,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:49,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322901157] [2023-08-29 20:51:49,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:51:49,526 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-29 20:51:49,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:49,527 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-29 20:51:49,530 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-29 20:51:49,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:51:49,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:51:49,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-29 20:51:49,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:50,173 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-29 20:51:50,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:50,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:50,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322901157] [2023-08-29 20:51:50,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322901157] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:50,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:50,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:51:50,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178130764] [2023-08-29 20:51:50,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:50,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:51:50,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:50,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:51:50,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:51:50,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 233 [2023-08-29 20:51:50,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 174 flow. Second operand has 9 states, 9 states have (on average 98.33333333333333) internal successors, (885), 9 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:50,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:50,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 233 [2023-08-29 20:51:50,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:50,485 INFO L130 PetriNetUnfolder]: 169/344 cut-off events. [2023-08-29 20:51:50,486 INFO L131 PetriNetUnfolder]: For 361/361 co-relation queries the response was YES. [2023-08-29 20:51:50,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 344 events. 169/344 cut-off events. For 361/361 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1365 event pairs, 58 based on Foata normal form. 1/345 useless extension candidates. Maximal degree in co-relation 1195. Up to 239 conditions per place. [2023-08-29 20:51:50,487 INFO L137 encePairwiseOnDemand]: 224/233 looper letters, 38 selfloop transitions, 8 changer transitions 25/72 dead transitions. [2023-08-29 20:51:50,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 72 transitions, 492 flow [2023-08-29 20:51:50,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:51:50,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:51:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 914 transitions. [2023-08-29 20:51:50,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43586075345732 [2023-08-29 20:51:50,490 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 914 transitions. [2023-08-29 20:51:50,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 914 transitions. [2023-08-29 20:51:50,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:50,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 914 transitions. [2023-08-29 20:51:50,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 101.55555555555556) internal successors, (914), 9 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:50,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 233.0) internal successors, (2330), 10 states have internal predecessors, (2330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:50,495 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 233.0) internal successors, (2330), 10 states have internal predecessors, (2330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:50,495 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 174 flow. Second operand 9 states and 914 transitions. [2023-08-29 20:51:50,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 72 transitions, 492 flow [2023-08-29 20:51:50,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 72 transitions, 477 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-29 20:51:50,498 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 223 flow [2023-08-29 20:51:50,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=223, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2023-08-29 20:51:50,499 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2023-08-29 20:51:50,499 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 223 flow [2023-08-29 20:51:50,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 98.33333333333333) internal successors, (885), 9 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:50,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:50,499 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-29 20:51:50,513 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-29 20:51:50,707 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-29 20:51:50,707 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:50,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:50,707 INFO L85 PathProgramCache]: Analyzing trace with hash 216600732, now seen corresponding path program 4 times [2023-08-29 20:51:50,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:50,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527713408] [2023-08-29 20:51:50,708 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 20:51:50,708 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-29 20:51:50,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:50,710 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-29 20:51:50,742 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-29 20:51:50,797 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 20:51:50,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:51:50,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-29 20:51:50,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:50,950 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-29 20:51:50,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:50,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:50,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527713408] [2023-08-29 20:51:50,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527713408] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:50,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:50,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:51:50,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464120435] [2023-08-29 20:51:50,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:50,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:51:50,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:50,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:51:50,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:51:50,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 233 [2023-08-29 20:51:50,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 223 flow. Second operand has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:50,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:50,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 233 [2023-08-29 20:51:50,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:51,103 INFO L130 PetriNetUnfolder]: 171/345 cut-off events. [2023-08-29 20:51:51,103 INFO L131 PetriNetUnfolder]: For 520/520 co-relation queries the response was YES. [2023-08-29 20:51:51,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1295 conditions, 345 events. 171/345 cut-off events. For 520/520 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1379 event pairs, 35 based on Foata normal form. 1/346 useless extension candidates. Maximal degree in co-relation 1280. Up to 278 conditions per place. [2023-08-29 20:51:51,105 INFO L137 encePairwiseOnDemand]: 224/233 looper letters, 44 selfloop transitions, 11 changer transitions 8/64 dead transitions. [2023-08-29 20:51:51,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 466 flow [2023-08-29 20:51:51,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:51:51,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:51:51,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2023-08-29 20:51:51,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4532188841201717 [2023-08-29 20:51:51,107 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 528 transitions. [2023-08-29 20:51:51,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 528 transitions. [2023-08-29 20:51:51,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:51,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 528 transitions. [2023-08-29 20:51:51,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:51,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:51,109 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:51,109 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 223 flow. Second operand 5 states and 528 transitions. [2023-08-29 20:51:51,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 64 transitions, 466 flow [2023-08-29 20:51:51,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 64 transitions, 445 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-08-29 20:51:51,112 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 300 flow [2023-08-29 20:51:51,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=300, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-08-29 20:51:51,112 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2023-08-29 20:51:51,112 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 300 flow [2023-08-29 20:51:51,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:51,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:51,113 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-29 20:51:51,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-29 20:51:51,321 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-29 20:51:51,321 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:51,321 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:51,321 INFO L85 PathProgramCache]: Analyzing trace with hash -2083966200, now seen corresponding path program 5 times [2023-08-29 20:51:51,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:51,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134906934] [2023-08-29 20:51:51,321 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-29 20:51:51,322 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-29 20:51:51,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:51,323 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-29 20:51:51,325 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-29 20:51:51,420 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:51:51,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:51:51,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-29 20:51:51,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:53,189 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-29 20:51:53,190 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:53,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:53,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134906934] [2023-08-29 20:51:53,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134906934] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:53,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:53,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 20:51:53,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944285913] [2023-08-29 20:51:53,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:53,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 20:51:53,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:53,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 20:51:53,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-08-29 20:51:53,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 233 [2023-08-29 20:51:53,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 300 flow. Second operand has 10 states, 10 states have (on average 97.1) internal successors, (971), 10 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:53,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:53,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 233 [2023-08-29 20:51:53,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:53,651 INFO L130 PetriNetUnfolder]: 237/480 cut-off events. [2023-08-29 20:51:53,651 INFO L131 PetriNetUnfolder]: For 1119/1123 co-relation queries the response was YES. [2023-08-29 20:51:53,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2023 conditions, 480 events. 237/480 cut-off events. For 1119/1123 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2203 event pairs, 39 based on Foata normal form. 1/480 useless extension candidates. Maximal degree in co-relation 2008. Up to 285 conditions per place. [2023-08-29 20:51:53,654 INFO L137 encePairwiseOnDemand]: 224/233 looper letters, 51 selfloop transitions, 13 changer transitions 54/119 dead transitions. [2023-08-29 20:51:53,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 119 transitions, 968 flow [2023-08-29 20:51:53,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-29 20:51:53,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-29 20:51:53,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1403 transitions. [2023-08-29 20:51:53,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43010423053341507 [2023-08-29 20:51:53,658 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1403 transitions. [2023-08-29 20:51:53,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1403 transitions. [2023-08-29 20:51:53,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:53,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1403 transitions. [2023-08-29 20:51:53,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 100.21428571428571) internal successors, (1403), 14 states have internal predecessors, (1403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:53,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 233.0) internal successors, (3495), 15 states have internal predecessors, (3495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:53,664 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 233.0) internal successors, (3495), 15 states have internal predecessors, (3495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:53,665 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 300 flow. Second operand 14 states and 1403 transitions. [2023-08-29 20:51:53,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 119 transitions, 968 flow [2023-08-29 20:51:53,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 119 transitions, 951 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-29 20:51:53,669 INFO L231 Difference]: Finished difference. Result has 75 places, 51 transitions, 389 flow [2023-08-29 20:51:53,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=389, PETRI_PLACES=75, PETRI_TRANSITIONS=51} [2023-08-29 20:51:53,669 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2023-08-29 20:51:53,670 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 51 transitions, 389 flow [2023-08-29 20:51:53,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 97.1) internal successors, (971), 10 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:53,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:53,670 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-29 20:51:53,680 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-29 20:51:53,877 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-29 20:51:53,878 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:53,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:53,878 INFO L85 PathProgramCache]: Analyzing trace with hash 472748724, now seen corresponding path program 6 times [2023-08-29 20:51:53,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:53,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824606656] [2023-08-29 20:51:53,879 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-29 20:51:53,879 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-29 20:51:53,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:53,880 INFO L229 MonitoredProcess]: Starting monitored process 13 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-29 20:51:53,882 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 (13)] Waiting until timeout for monitored process [2023-08-29 20:51:53,965 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-08-29 20:51:53,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:51:53,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-29 20:51:53,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:54,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:54,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:54,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:54,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824606656] [2023-08-29 20:51:54,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824606656] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:54,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:54,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:51:54,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295265237] [2023-08-29 20:51:54,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:54,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:51:54,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:54,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:51:54,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:51:54,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 233 [2023-08-29 20:51:54,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 51 transitions, 389 flow. Second operand has 8 states, 8 states have (on average 98.625) internal successors, (789), 8 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:54,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:54,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 233 [2023-08-29 20:51:54,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:54,388 INFO L130 PetriNetUnfolder]: 231/462 cut-off events. [2023-08-29 20:51:54,388 INFO L131 PetriNetUnfolder]: For 1758/1760 co-relation queries the response was YES. [2023-08-29 20:51:54,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2187 conditions, 462 events. 231/462 cut-off events. For 1758/1760 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2060 event pairs, 27 based on Foata normal form. 1/462 useless extension candidates. Maximal degree in co-relation 2164. Up to 173 conditions per place. [2023-08-29 20:51:54,390 INFO L137 encePairwiseOnDemand]: 223/233 looper letters, 57 selfloop transitions, 16 changer transitions 28/102 dead transitions. [2023-08-29 20:51:54,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 102 transitions, 911 flow [2023-08-29 20:51:54,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:51:54,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:51:54,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 822 transitions. [2023-08-29 20:51:54,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4409871244635193 [2023-08-29 20:51:54,393 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 822 transitions. [2023-08-29 20:51:54,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 822 transitions. [2023-08-29 20:51:54,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:54,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 822 transitions. [2023-08-29 20:51:54,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 102.75) internal successors, (822), 8 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:54,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:54,397 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:54,397 INFO L175 Difference]: Start difference. First operand has 75 places, 51 transitions, 389 flow. Second operand 8 states and 822 transitions. [2023-08-29 20:51:54,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 102 transitions, 911 flow [2023-08-29 20:51:54,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 102 transitions, 848 flow, removed 29 selfloop flow, removed 10 redundant places. [2023-08-29 20:51:54,401 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 412 flow [2023-08-29 20:51:54,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=412, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2023-08-29 20:51:54,403 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2023-08-29 20:51:54,403 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 412 flow [2023-08-29 20:51:54,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.625) internal successors, (789), 8 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:54,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:54,403 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-29 20:51:54,411 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 (13)] Forceful destruction successful, exit code 0 [2023-08-29 20:51:54,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-29 20:51:54,612 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:54,612 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:54,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1629523106, now seen corresponding path program 7 times [2023-08-29 20:51:54,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:54,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535619790] [2023-08-29 20:51:54,613 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-29 20:51:54,613 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-29 20:51:54,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:54,614 INFO L229 MonitoredProcess]: Starting monitored process 14 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-29 20:51:54,616 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 (14)] Waiting until timeout for monitored process [2023-08-29 20:51:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:54,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-29 20:51:54,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:54,813 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-29 20:51:54,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:54,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:54,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535619790] [2023-08-29 20:51:54,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [535619790] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:54,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:54,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:51:54,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120539173] [2023-08-29 20:51:54,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:54,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:51:54,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:54,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:51:54,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:51:54,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 233 [2023-08-29 20:51:54,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 412 flow. Second operand has 8 states, 8 states have (on average 98.625) internal successors, (789), 8 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:54,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:54,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 233 [2023-08-29 20:51:54,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:55,034 INFO L130 PetriNetUnfolder]: 237/481 cut-off events. [2023-08-29 20:51:55,034 INFO L131 PetriNetUnfolder]: For 1807/1809 co-relation queries the response was YES. [2023-08-29 20:51:55,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2293 conditions, 481 events. 237/481 cut-off events. For 1807/1809 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2216 event pairs, 86 based on Foata normal form. 1/481 useless extension candidates. Maximal degree in co-relation 2273. Up to 352 conditions per place. [2023-08-29 20:51:55,037 INFO L137 encePairwiseOnDemand]: 224/233 looper letters, 44 selfloop transitions, 6 changer transitions 30/81 dead transitions. [2023-08-29 20:51:55,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 81 transitions, 764 flow [2023-08-29 20:51:55,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:51:55,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:51:55,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 813 transitions. [2023-08-29 20:51:55,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4361587982832618 [2023-08-29 20:51:55,039 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 813 transitions. [2023-08-29 20:51:55,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 813 transitions. [2023-08-29 20:51:55,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:55,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 813 transitions. [2023-08-29 20:51:55,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 101.625) internal successors, (813), 8 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:55,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:55,043 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:55,043 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 412 flow. Second operand 8 states and 813 transitions. [2023-08-29 20:51:55,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 81 transitions, 764 flow [2023-08-29 20:51:55,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 81 transitions, 711 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-08-29 20:51:55,047 INFO L231 Difference]: Finished difference. Result has 67 places, 48 transitions, 354 flow [2023-08-29 20:51:55,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=354, PETRI_PLACES=67, PETRI_TRANSITIONS=48} [2023-08-29 20:51:55,048 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2023-08-29 20:51:55,048 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 48 transitions, 354 flow [2023-08-29 20:51:55,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.625) internal successors, (789), 8 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:55,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:55,049 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-29 20:51:55,057 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 (14)] Forceful destruction successful, exit code 0 [2023-08-29 20:51:55,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-29 20:51:55,257 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:55,257 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:55,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1980470108, now seen corresponding path program 8 times [2023-08-29 20:51:55,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:55,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553020978] [2023-08-29 20:51:55,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:51:55,258 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-29 20:51:55,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:55,259 INFO L229 MonitoredProcess]: Starting monitored process 15 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-29 20:51:55,261 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 (15)] Waiting until timeout for monitored process [2023-08-29 20:51:55,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:51:55,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:51:55,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-29 20:51:55,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:55,473 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-29 20:51:55,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:55,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:55,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553020978] [2023-08-29 20:51:55,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553020978] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:55,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:55,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:51:55,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785428434] [2023-08-29 20:51:55,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:55,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:51:55,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:55,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:51:55,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:51:55,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 233 [2023-08-29 20:51:55,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 48 transitions, 354 flow. Second operand has 8 states, 8 states have (on average 99.625) internal successors, (797), 8 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:55,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:55,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 233 [2023-08-29 20:51:55,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:55,707 INFO L130 PetriNetUnfolder]: 188/398 cut-off events. [2023-08-29 20:51:55,707 INFO L131 PetriNetUnfolder]: For 1245/1247 co-relation queries the response was YES. [2023-08-29 20:51:55,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1813 conditions, 398 events. 188/398 cut-off events. For 1245/1247 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1756 event pairs, 85 based on Foata normal form. 1/398 useless extension candidates. Maximal degree in co-relation 1793. Up to 311 conditions per place. [2023-08-29 20:51:55,709 INFO L137 encePairwiseOnDemand]: 225/233 looper letters, 41 selfloop transitions, 5 changer transitions 28/75 dead transitions. [2023-08-29 20:51:55,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 75 transitions, 672 flow [2023-08-29 20:51:55,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:51:55,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:51:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 820 transitions. [2023-08-29 20:51:55,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43991416309012876 [2023-08-29 20:51:55,711 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 820 transitions. [2023-08-29 20:51:55,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 820 transitions. [2023-08-29 20:51:55,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:55,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 820 transitions. [2023-08-29 20:51:55,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 102.5) internal successors, (820), 8 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:55,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:55,715 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:55,715 INFO L175 Difference]: Start difference. First operand has 67 places, 48 transitions, 354 flow. Second operand 8 states and 820 transitions. [2023-08-29 20:51:55,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 75 transitions, 672 flow [2023-08-29 20:51:55,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 75 transitions, 641 flow, removed 9 selfloop flow, removed 7 redundant places. [2023-08-29 20:51:55,719 INFO L231 Difference]: Finished difference. Result has 68 places, 44 transitions, 314 flow [2023-08-29 20:51:55,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=314, PETRI_PLACES=68, PETRI_TRANSITIONS=44} [2023-08-29 20:51:55,719 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2023-08-29 20:51:55,719 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 44 transitions, 314 flow [2023-08-29 20:51:55,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 99.625) internal successors, (797), 8 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:55,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:55,720 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-29 20:51:55,728 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 (15)] Forceful destruction successful, exit code 0 [2023-08-29 20:51:55,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-29 20:51:55,928 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:55,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:55,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1672327534, now seen corresponding path program 9 times [2023-08-29 20:51:55,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:55,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336467682] [2023-08-29 20:51:55,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:51:55,929 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-29 20:51:55,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:55,930 INFO L229 MonitoredProcess]: Starting monitored process 16 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-29 20:51:55,934 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 (16)] Waiting until timeout for monitored process [2023-08-29 20:51:56,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:51:56,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:51:56,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-29 20:51:56,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:56,220 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-29 20:51:56,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:56,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:56,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336467682] [2023-08-29 20:51:56,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336467682] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:56,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:56,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:51:56,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109599327] [2023-08-29 20:51:56,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:56,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:51:56,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:56,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:51:56,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:51:56,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 233 [2023-08-29 20:51:56,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 44 transitions, 314 flow. Second operand has 8 states, 8 states have (on average 98.625) internal successors, (789), 8 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:56,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:56,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 233 [2023-08-29 20:51:56,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:56,487 INFO L130 PetriNetUnfolder]: 211/444 cut-off events. [2023-08-29 20:51:56,487 INFO L131 PetriNetUnfolder]: For 1267/1269 co-relation queries the response was YES. [2023-08-29 20:51:56,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1980 conditions, 444 events. 211/444 cut-off events. For 1267/1269 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2034 event pairs, 43 based on Foata normal form. 1/444 useless extension candidates. Maximal degree in co-relation 1960. Up to 232 conditions per place. [2023-08-29 20:51:56,489 INFO L137 encePairwiseOnDemand]: 225/233 looper letters, 45 selfloop transitions, 6 changer transitions 37/89 dead transitions. [2023-08-29 20:51:56,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 89 transitions, 787 flow [2023-08-29 20:51:56,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:51:56,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:51:56,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 723 transitions. [2023-08-29 20:51:56,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4432863274064991 [2023-08-29 20:51:56,491 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 723 transitions. [2023-08-29 20:51:56,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 723 transitions. [2023-08-29 20:51:56,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:56,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 723 transitions. [2023-08-29 20:51:56,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.28571428571429) internal successors, (723), 7 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:56,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:56,495 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:56,495 INFO L175 Difference]: Start difference. First operand has 68 places, 44 transitions, 314 flow. Second operand 7 states and 723 transitions. [2023-08-29 20:51:56,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 89 transitions, 787 flow [2023-08-29 20:51:56,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 89 transitions, 731 flow, removed 20 selfloop flow, removed 9 redundant places. [2023-08-29 20:51:56,499 INFO L231 Difference]: Finished difference. Result has 65 places, 44 transitions, 312 flow [2023-08-29 20:51:56,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=312, PETRI_PLACES=65, PETRI_TRANSITIONS=44} [2023-08-29 20:51:56,499 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2023-08-29 20:51:56,499 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 44 transitions, 312 flow [2023-08-29 20:51:56,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.625) internal successors, (789), 8 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:56,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:56,500 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-29 20:51:56,508 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 (16)] Forceful destruction successful, exit code 0 [2023-08-29 20:51:56,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-29 20:51:56,707 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:56,708 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:56,708 INFO L85 PathProgramCache]: Analyzing trace with hash -930879254, now seen corresponding path program 10 times [2023-08-29 20:51:56,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:56,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782730129] [2023-08-29 20:51:56,708 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 20:51:56,708 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-29 20:51:56,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:56,709 INFO L229 MonitoredProcess]: Starting monitored process 17 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-29 20:51:56,711 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 (17)] Waiting until timeout for monitored process [2023-08-29 20:51:56,794 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 20:51:56,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:51:56,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 23 conjunts are in the unsatisfiable core [2023-08-29 20:51:56,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:57,027 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-29 20:51:57,027 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:57,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:57,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782730129] [2023-08-29 20:51:57,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782730129] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:57,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:57,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:51:57,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289465396] [2023-08-29 20:51:57,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:57,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:51:57,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:57,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:51:57,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:51:57,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 233 [2023-08-29 20:51:57,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 44 transitions, 312 flow. Second operand has 9 states, 9 states have (on average 99.33333333333333) internal successors, (894), 9 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:57,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:57,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 233 [2023-08-29 20:51:57,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:57,295 INFO L130 PetriNetUnfolder]: 160/350 cut-off events. [2023-08-29 20:51:57,295 INFO L131 PetriNetUnfolder]: For 926/927 co-relation queries the response was YES. [2023-08-29 20:51:57,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1564 conditions, 350 events. 160/350 cut-off events. For 926/927 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1587 event pairs, 23 based on Foata normal form. 2/352 useless extension candidates. Maximal degree in co-relation 1544. Up to 109 conditions per place. [2023-08-29 20:51:57,297 INFO L137 encePairwiseOnDemand]: 224/233 looper letters, 49 selfloop transitions, 13 changer transitions 31/94 dead transitions. [2023-08-29 20:51:57,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 94 transitions, 808 flow [2023-08-29 20:51:57,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:51:57,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:51:57,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 925 transitions. [2023-08-29 20:51:57,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44110634239389607 [2023-08-29 20:51:57,299 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 925 transitions. [2023-08-29 20:51:57,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 925 transitions. [2023-08-29 20:51:57,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:57,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 925 transitions. [2023-08-29 20:51:57,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 102.77777777777777) internal successors, (925), 9 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:57,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 233.0) internal successors, (2330), 10 states have internal predecessors, (2330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:57,303 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 233.0) internal successors, (2330), 10 states have internal predecessors, (2330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:57,303 INFO L175 Difference]: Start difference. First operand has 65 places, 44 transitions, 312 flow. Second operand 9 states and 925 transitions. [2023-08-29 20:51:57,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 94 transitions, 808 flow [2023-08-29 20:51:57,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 94 transitions, 761 flow, removed 18 selfloop flow, removed 9 redundant places. [2023-08-29 20:51:57,307 INFO L231 Difference]: Finished difference. Result has 65 places, 47 transitions, 360 flow [2023-08-29 20:51:57,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=360, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2023-08-29 20:51:57,307 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2023-08-29 20:51:57,307 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 360 flow [2023-08-29 20:51:57,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 99.33333333333333) internal successors, (894), 9 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:57,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:57,308 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-29 20:51:57,316 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 (17)] Forceful destruction successful, exit code 0 [2023-08-29 20:51:57,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-29 20:51:57,516 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:57,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:57,516 INFO L85 PathProgramCache]: Analyzing trace with hash 227095866, now seen corresponding path program 11 times [2023-08-29 20:51:57,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:57,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082523520] [2023-08-29 20:51:57,517 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-29 20:51:57,517 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-29 20:51:57,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:57,518 INFO L229 MonitoredProcess]: Starting monitored process 18 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-29 20:51:57,519 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 (18)] Waiting until timeout for monitored process [2023-08-29 20:51:57,616 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:51:57,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:51:57,617 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:51:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:51:57,724 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:51:57,724 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:51:57,725 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-29 20:51:57,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-29 20:51:57,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-29 20:51:57,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-29 20:51:57,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-29 20:51:57,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-29 20:51:57,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-29 20:51:57,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-29 20:51:57,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-29 20:51:57,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-29 20:51:57,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-29 20:51:57,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-29 20:51:57,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-29 20:51:57,751 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 (18)] Forceful destruction successful, exit code 0 [2023-08-29 20:51:57,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-29 20:51:57,928 INFO L445 BasicCegarLoop]: Path program histogram: [11, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:57,931 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:51:57,932 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:51:57,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:51:57 BasicIcfg [2023-08-29 20:51:57,971 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:51:57,972 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:51:57,972 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:51:57,972 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:51:57,972 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:51:39" (3/4) ... [2023-08-29 20:51:57,974 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:51:57,974 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:51:57,974 INFO L158 Benchmark]: Toolchain (without parser) took 19842.22ms. Allocated memory was 77.6MB in the beginning and 425.7MB in the end (delta: 348.1MB). Free memory was 54.2MB in the beginning and 179.1MB in the end (delta: -124.9MB). Peak memory consumption was 224.7MB. Max. memory is 16.1GB. [2023-08-29 20:51:57,974 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 62.9MB. Free memory was 41.0MB in the beginning and 40.9MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:51:57,974 INFO L158 Benchmark]: CACSL2BoogieTranslator took 474.37ms. Allocated memory is still 77.6MB. Free memory was 54.2MB in the beginning and 49.9MB in the end (delta: 4.3MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2023-08-29 20:51:57,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.90ms. Allocated memory is still 77.6MB. Free memory was 49.9MB in the beginning and 47.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:51:57,975 INFO L158 Benchmark]: Boogie Preprocessor took 45.66ms. Allocated memory is still 77.6MB. Free memory was 47.4MB in the beginning and 45.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:51:57,975 INFO L158 Benchmark]: RCFGBuilder took 634.59ms. Allocated memory is still 77.6MB. Free memory was 45.0MB in the beginning and 32.6MB in the end (delta: 12.3MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2023-08-29 20:51:57,975 INFO L158 Benchmark]: TraceAbstraction took 18620.96ms. Allocated memory was 77.6MB in the beginning and 425.7MB in the end (delta: 348.1MB). Free memory was 31.7MB in the beginning and 179.1MB in the end (delta: -147.4MB). Peak memory consumption was 200.5MB. Max. memory is 16.1GB. [2023-08-29 20:51:57,975 INFO L158 Benchmark]: Witness Printer took 2.20ms. Allocated memory is still 425.7MB. Free memory is still 179.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:51:57,976 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 62.9MB. Free memory was 41.0MB in the beginning and 40.9MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 474.37ms. Allocated memory is still 77.6MB. Free memory was 54.2MB in the beginning and 49.9MB in the end (delta: 4.3MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.90ms. Allocated memory is still 77.6MB. Free memory was 49.9MB in the beginning and 47.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.66ms. Allocated memory is still 77.6MB. Free memory was 47.4MB in the beginning and 45.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 634.59ms. Allocated memory is still 77.6MB. Free memory was 45.0MB in the beginning and 32.6MB in the end (delta: 12.3MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. * TraceAbstraction took 18620.96ms. Allocated memory was 77.6MB in the beginning and 425.7MB in the end (delta: 348.1MB). Free memory was 31.7MB in the beginning and 179.1MB in the end (delta: -147.4MB). Peak memory consumption was 200.5MB. Max. memory is 16.1GB. * Witness Printer took 2.20ms. Allocated memory is still 425.7MB. Free memory is still 179.1MB. 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.5s, 123 PlacesBefore, 42 PlacesAfterwards, 115 TransitionsBefore, 33 TransitionsAfterwards, 2088 CoEnabledTransitionPairs, 6 FixpointIterations, 47 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 115 TotalNumberOfCompositions, 5683 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2248, independent: 2083, independent conditional: 0, independent unconditional: 2083, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1110, independent: 1066, independent conditional: 0, independent unconditional: 1066, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2248, independent: 1017, independent conditional: 0, independent unconditional: 1017, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 1110, unknown conditional: 0, unknown unconditional: 1110] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 75, Positive conditional cache size: 0, Positive unconditional cache size: 75, 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: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2537, ((void *)0), P0, ((void *)0))=0, t2537={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2538, ((void *)0), P1, ((void *)0))=1, t2537={3:0}, t2538={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2539, ((void *)0), P2, ((void *)0))=2, t2537={3:0}, t2538={7:0}, t2539={11:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={3:0}, t2538={7:0}, t2539={11:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 852]: 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: 850]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 145 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.5s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 820 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 654 mSDsluCounter, 1020 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 938 mSDsCounter, 237 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3214 IncrementalHoareTripleChecker+Invalid, 3451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 237 mSolverCounterUnsat, 82 mSDtfsCounter, 3214 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=412occurred in iteration=12, InterpolantAutomatonStates: 108, 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.7s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 312 NumberOfCodeBlocks, 312 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 274 ConstructedInterpolants, 15 QuantifiedInterpolants, 2656 SizeOfPredicates, 40 NumberOfNonLiveVariables, 2476 ConjunctsInSsa, 201 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-29 20:51:58,000 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