./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a8f8518887bc2e5e0d6d71e32a92b54f9a899d1e11c58bdb579bc81d5f31bb3 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:52:48,795 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:52:48,797 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:52:48,830 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:52:48,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:52:48,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:52:48,837 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:52:48,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:52:48,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:52:48,846 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:52:48,847 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:52:48,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:52:48,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:52:48,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:52:48,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:52:48,859 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:52:48,860 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:52:48,861 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:52:48,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:52:48,868 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:52:48,869 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:52:48,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:52:48,879 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:52:48,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:52:48,886 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:52:48,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:52:48,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:52:48,889 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:52:48,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:52:48,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:52:48,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:52:48,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:52:48,898 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:52:48,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:52:48,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:52:48,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:52:48,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:52:48,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:52:48,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:52:48,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:52:48,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:52:48,904 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 02:52:48,945 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:52:48,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:52:48,947 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:52:48,947 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:52:48,948 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:52:48,948 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:52:48,948 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:52:48,949 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:52:48,949 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:52:48,949 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:52:48,950 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:52:48,950 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:52:48,950 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:52:48,950 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:52:48,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:52:48,951 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:52:48,951 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:52:48,951 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:52:48,951 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:52:48,952 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:52:48,952 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:52:48,952 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:52:48,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:52:48,952 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:52:48,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:52:48,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:52:48,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:52:48,953 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:52:48,953 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:52:48,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:52:48,954 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:52:48,954 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:52:48,954 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:52:48,955 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:52:48,955 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 -> 3a8f8518887bc2e5e0d6d71e32a92b54f9a899d1e11c58bdb579bc81d5f31bb3 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 02:52:49,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:52:49,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:52:49,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:52:49,295 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:52:49,296 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:52:49,298 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-08-30 02:52:50,562 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:52:50,837 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:52:50,841 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-08-30 02:52:50,867 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4547bbfd/cfa3c3b9b03f4c9e94bf29295be0268b/FLAGc974fe51a [2023-08-30 02:52:50,883 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4547bbfd/cfa3c3b9b03f4c9e94bf29295be0268b [2023-08-30 02:52:50,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:52:50,888 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:52:50,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:52:50,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:52:50,894 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:52:50,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:52:50" (1/1) ... [2023-08-30 02:52:50,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f6302ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:50, skipping insertion in model container [2023-08-30 02:52:50,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:52:50" (1/1) ... [2023-08-30 02:52:50,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:52:50,956 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:52:51,128 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/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2023-08-30 02:52:51,296 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:52:51,311 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:52:51,321 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/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2023-08-30 02:52:51,370 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:52:51,407 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:52:51,408 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:52:51,414 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:52:51,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:51 WrapperNode [2023-08-30 02:52:51,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:52:51,418 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:52:51,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:52:51,418 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:52:51,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:51" (1/1) ... [2023-08-30 02:52:51,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:51" (1/1) ... [2023-08-30 02:52:51,468 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 115 [2023-08-30 02:52:51,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:52:51,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:52:51,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:52:51,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:52:51,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:51" (1/1) ... [2023-08-30 02:52:51,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:51" (1/1) ... [2023-08-30 02:52:51,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:51" (1/1) ... [2023-08-30 02:52:51,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:51" (1/1) ... [2023-08-30 02:52:51,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:51" (1/1) ... [2023-08-30 02:52:51,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:51" (1/1) ... [2023-08-30 02:52:51,490 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:51" (1/1) ... [2023-08-30 02:52:51,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:51" (1/1) ... [2023-08-30 02:52:51,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:52:51,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:52:51,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:52:51,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:52:51,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:51" (1/1) ... [2023-08-30 02:52:51,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:52:51,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:52:51,558 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 02:52:51,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 02:52:51,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:52:51,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:52:51,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:52:51,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:52:51,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:52:51,595 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:52:51,595 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:52:51,595 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:52:51,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:52:51,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:52:51,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:52:51,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:52:51,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:52:51,597 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:52:51,780 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:52:51,782 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:52:52,040 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:52:52,193 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:52:52,193 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:52:52,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:52:52 BoogieIcfgContainer [2023-08-30 02:52:52,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:52:52,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:52:52,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:52:52,201 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:52:52,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:52:50" (1/3) ... [2023-08-30 02:52:52,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acd304e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:52:52, skipping insertion in model container [2023-08-30 02:52:52,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:52:51" (2/3) ... [2023-08-30 02:52:52,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acd304e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:52:52, skipping insertion in model container [2023-08-30 02:52:52,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:52:52" (3/3) ... [2023-08-30 02:52:52,205 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-08-30 02:52:52,221 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:52:52,221 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-30 02:52:52,221 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:52:52,273 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:52:52,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 100 transitions, 210 flow [2023-08-30 02:52:52,359 INFO L130 PetriNetUnfolder]: 2/98 cut-off events. [2023-08-30 02:52:52,360 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:52:52,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-08-30 02:52:52,371 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 100 transitions, 210 flow [2023-08-30 02:52:52,374 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 98 transitions, 202 flow [2023-08-30 02:52:52,378 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:52:52,386 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 98 transitions, 202 flow [2023-08-30 02:52:52,388 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 98 transitions, 202 flow [2023-08-30 02:52:52,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 98 transitions, 202 flow [2023-08-30 02:52:52,414 INFO L130 PetriNetUnfolder]: 2/98 cut-off events. [2023-08-30 02:52:52,419 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:52:52,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-08-30 02:52:52,421 INFO L119 LiptonReduction]: Number of co-enabled transitions 1308 [2023-08-30 02:52:55,775 INFO L134 LiptonReduction]: Checked pairs total: 3575 [2023-08-30 02:52:55,775 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-08-30 02:52:55,788 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:52:55,793 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;@5a2eb895, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:52:55,794 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-30 02:52:55,795 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:52:55,796 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:52:55,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:55,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:52:55,797 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:55,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:55,801 INFO L85 PathProgramCache]: Analyzing trace with hash 449, now seen corresponding path program 1 times [2023-08-30 02:52:55,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:52:55,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016510895] [2023-08-30 02:52:55,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:55,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:52:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:52:55,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:55,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:52:55,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016510895] [2023-08-30 02:52:55,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016510895] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:55,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:55,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:52:55,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025240169] [2023-08-30 02:52:55,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:55,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:52:55,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:52:55,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:52:55,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:52:55,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 197 [2023-08-30 02:52:55,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 56 flow. Second operand has 2 states, 2 states have (on average 89.5) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:55,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:55,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 197 [2023-08-30 02:52:55,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:56,102 INFO L130 PetriNetUnfolder]: 322/545 cut-off events. [2023-08-30 02:52:56,102 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 02:52:56,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1104 conditions, 545 events. 322/545 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2191 event pairs, 322 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 1094. Up to 544 conditions per place. [2023-08-30 02:52:56,107 INFO L137 encePairwiseOnDemand]: 192/197 looper letters, 19 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2023-08-30 02:52:56,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 84 flow [2023-08-30 02:52:56,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:52:56,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:52:56,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 202 transitions. [2023-08-30 02:52:56,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5126903553299492 [2023-08-30 02:52:56,127 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 202 transitions. [2023-08-30 02:52:56,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 202 transitions. [2023-08-30 02:52:56,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:56,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 202 transitions. [2023-08-30 02:52:56,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:56,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:56,137 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:56,139 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 56 flow. Second operand 2 states and 202 transitions. [2023-08-30 02:52:56,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 84 flow [2023-08-30 02:52:56,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:52:56,142 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 44 flow [2023-08-30 02:52:56,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2023-08-30 02:52:56,147 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -5 predicate places. [2023-08-30 02:52:56,147 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 44 flow [2023-08-30 02:52:56,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 89.5) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:56,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:56,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:52:56,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:52:56,148 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:56,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:56,149 INFO L85 PathProgramCache]: Analyzing trace with hash 442812, now seen corresponding path program 1 times [2023-08-30 02:52:56,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:52:56,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994746639] [2023-08-30 02:52:56,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:56,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:52:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:52:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:56,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:52:56,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994746639] [2023-08-30 02:52:56,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994746639] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:56,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:56,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:52:56,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846426298] [2023-08-30 02:52:56,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:56,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:52:56,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:52:56,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:52:56,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:52:56,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 197 [2023-08-30 02:52:56,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:56,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:56,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 197 [2023-08-30 02:52:56,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:56,565 INFO L130 PetriNetUnfolder]: 249/470 cut-off events. [2023-08-30 02:52:56,565 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:52:56,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 470 events. 249/470 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2165 event pairs, 30 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 906. Up to 352 conditions per place. [2023-08-30 02:52:56,571 INFO L137 encePairwiseOnDemand]: 194/197 looper letters, 27 selfloop transitions, 2 changer transitions 2/32 dead transitions. [2023-08-30 02:52:56,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 32 transitions, 132 flow [2023-08-30 02:52:56,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:52:56,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:52:56,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-08-30 02:52:56,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5008460236886633 [2023-08-30 02:52:56,577 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-08-30 02:52:56,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-08-30 02:52:56,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:56,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-08-30 02:52:56,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:56,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:56,583 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:56,583 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 44 flow. Second operand 3 states and 296 transitions. [2023-08-30 02:52:56,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 32 transitions, 132 flow [2023-08-30 02:52:56,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 32 transitions, 132 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:52:56,585 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 44 flow [2023-08-30 02:52:56,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2023-08-30 02:52:56,586 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2023-08-30 02:52:56,586 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 44 flow [2023-08-30 02:52:56,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:56,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:56,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:52:56,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:52:56,587 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:56,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:56,590 INFO L85 PathProgramCache]: Analyzing trace with hash 981343068, now seen corresponding path program 1 times [2023-08-30 02:52:56,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:52:56,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445521676] [2023-08-30 02:52:56,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:56,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:52:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:52:56,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:56,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:52:56,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445521676] [2023-08-30 02:52:56,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445521676] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:56,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:56,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:52:56,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667215131] [2023-08-30 02:52:56,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:56,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:52:56,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:52:56,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:52:56,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:52:56,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 197 [2023-08-30 02:52:56,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:56,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:56,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 197 [2023-08-30 02:52:56,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:57,035 INFO L130 PetriNetUnfolder]: 321/560 cut-off events. [2023-08-30 02:52:57,035 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2023-08-30 02:52:57,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 560 events. 321/560 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2331 event pairs, 111 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 1177. Up to 407 conditions per place. [2023-08-30 02:52:57,038 INFO L137 encePairwiseOnDemand]: 191/197 looper letters, 28 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2023-08-30 02:52:57,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 33 transitions, 144 flow [2023-08-30 02:52:57,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:52:57,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:52:57,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2023-08-30 02:52:57,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48392554991539766 [2023-08-30 02:52:57,040 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 286 transitions. [2023-08-30 02:52:57,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 286 transitions. [2023-08-30 02:52:57,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:57,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 286 transitions. [2023-08-30 02:52:57,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:57,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:57,043 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:57,043 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 44 flow. Second operand 3 states and 286 transitions. [2023-08-30 02:52:57,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 33 transitions, 144 flow [2023-08-30 02:52:57,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 33 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:52:57,044 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 78 flow [2023-08-30 02:52:57,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2023-08-30 02:52:57,045 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2023-08-30 02:52:57,045 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 78 flow [2023-08-30 02:52:57,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:57,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:57,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:52:57,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:52:57,046 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:57,046 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:57,046 INFO L85 PathProgramCache]: Analyzing trace with hash 356864376, now seen corresponding path program 1 times [2023-08-30 02:52:57,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:52:57,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303681570] [2023-08-30 02:52:57,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:57,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:52:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:52:57,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:57,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:52:57,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303681570] [2023-08-30 02:52:57,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303681570] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:57,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:57,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:52:57,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132790157] [2023-08-30 02:52:57,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:57,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:52:57,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:52:57,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:52:57,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:52:57,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 197 [2023-08-30 02:52:57,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 79.6) internal successors, (398), 5 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:57,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:57,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 197 [2023-08-30 02:52:57,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:57,471 INFO L130 PetriNetUnfolder]: 209/385 cut-off events. [2023-08-30 02:52:57,472 INFO L131 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2023-08-30 02:52:57,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 385 events. 209/385 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1536 event pairs, 117 based on Foata normal form. 50/435 useless extension candidates. Maximal degree in co-relation 943. Up to 256 conditions per place. [2023-08-30 02:52:57,474 INFO L137 encePairwiseOnDemand]: 193/197 looper letters, 17 selfloop transitions, 2 changer transitions 12/33 dead transitions. [2023-08-30 02:52:57,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 33 transitions, 170 flow [2023-08-30 02:52:57,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:52:57,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:52:57,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 418 transitions. [2023-08-30 02:52:57,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4243654822335025 [2023-08-30 02:52:57,476 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 418 transitions. [2023-08-30 02:52:57,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 418 transitions. [2023-08-30 02:52:57,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:57,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 418 transitions. [2023-08-30 02:52:57,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 83.6) internal successors, (418), 5 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:57,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:57,480 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:57,480 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 78 flow. Second operand 5 states and 418 transitions. [2023-08-30 02:52:57,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 33 transitions, 170 flow [2023-08-30 02:52:57,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 33 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:52:57,483 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 58 flow [2023-08-30 02:52:57,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2023-08-30 02:52:57,484 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-08-30 02:52:57,484 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 58 flow [2023-08-30 02:52:57,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.6) internal successors, (398), 5 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:57,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:57,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:52:57,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:52:57,485 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:57,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:57,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1054645756, now seen corresponding path program 1 times [2023-08-30 02:52:57,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:52:57,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033600006] [2023-08-30 02:52:57,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:57,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:52:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:52:57,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:57,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:52:57,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033600006] [2023-08-30 02:52:57,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033600006] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:57,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:57,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:52:57,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616396077] [2023-08-30 02:52:57,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:57,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:52:57,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:52:57,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:52:57,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:52:57,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 197 [2023-08-30 02:52:57,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:57,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:57,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 197 [2023-08-30 02:52:57,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:57,729 INFO L130 PetriNetUnfolder]: 141/255 cut-off events. [2023-08-30 02:52:57,729 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-30 02:52:57,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 255 events. 141/255 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 823 event pairs, 44 based on Foata normal form. 6/260 useless extension candidates. Maximal degree in co-relation 581. Up to 184 conditions per place. [2023-08-30 02:52:57,731 INFO L137 encePairwiseOnDemand]: 194/197 looper letters, 18 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2023-08-30 02:52:57,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 23 transitions, 110 flow [2023-08-30 02:52:57,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:52:57,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:52:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2023-08-30 02:52:57,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47715736040609136 [2023-08-30 02:52:57,733 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 282 transitions. [2023-08-30 02:52:57,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 282 transitions. [2023-08-30 02:52:57,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:57,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 282 transitions. [2023-08-30 02:52:57,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:57,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:57,736 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:57,736 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 58 flow. Second operand 3 states and 282 transitions. [2023-08-30 02:52:57,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 23 transitions, 110 flow [2023-08-30 02:52:57,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 23 transitions, 107 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:52:57,743 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 66 flow [2023-08-30 02:52:57,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2023-08-30 02:52:57,745 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2023-08-30 02:52:57,745 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 66 flow [2023-08-30 02:52:57,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:57,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:57,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:52:57,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:52:57,746 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:57,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:57,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1823716860, now seen corresponding path program 1 times [2023-08-30 02:52:57,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:52:57,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847449582] [2023-08-30 02:52:57,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:57,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:52:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:52:57,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:57,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:52:57,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847449582] [2023-08-30 02:52:57,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847449582] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:57,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:57,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:52:57,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578749486] [2023-08-30 02:52:57,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:57,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:52:57,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:52:57,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:52:57,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:52:57,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 197 [2023-08-30 02:52:57,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:57,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:57,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 197 [2023-08-30 02:52:57,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:58,088 INFO L130 PetriNetUnfolder]: 78/173 cut-off events. [2023-08-30 02:52:58,088 INFO L131 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2023-08-30 02:52:58,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 173 events. 78/173 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 614 event pairs, 15 based on Foata normal form. 28/200 useless extension candidates. Maximal degree in co-relation 427. Up to 72 conditions per place. [2023-08-30 02:52:58,089 INFO L137 encePairwiseOnDemand]: 192/197 looper letters, 29 selfloop transitions, 5 changer transitions 10/46 dead transitions. [2023-08-30 02:52:58,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 46 transitions, 239 flow [2023-08-30 02:52:58,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:52:58,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:52:58,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 469 transitions. [2023-08-30 02:52:58,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4761421319796954 [2023-08-30 02:52:58,092 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 469 transitions. [2023-08-30 02:52:58,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 469 transitions. [2023-08-30 02:52:58,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:58,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 469 transitions. [2023-08-30 02:52:58,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:58,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:58,096 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:58,096 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 66 flow. Second operand 5 states and 469 transitions. [2023-08-30 02:52:58,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 46 transitions, 239 flow [2023-08-30 02:52:58,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 46 transitions, 225 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:52:58,098 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 97 flow [2023-08-30 02:52:58,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=97, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-08-30 02:52:58,099 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2023-08-30 02:52:58,099 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 97 flow [2023-08-30 02:52:58,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:58,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:58,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:52:58,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:52:58,111 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:58,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:58,111 INFO L85 PathProgramCache]: Analyzing trace with hash -900720583, now seen corresponding path program 1 times [2023-08-30 02:52:58,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:52:58,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895807459] [2023-08-30 02:52:58,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:58,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:52:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:52:58,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:58,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:52:58,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895807459] [2023-08-30 02:52:58,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895807459] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:58,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:58,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:52:58,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990509066] [2023-08-30 02:52:58,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:58,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:52:58,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:52:58,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:52:58,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:52:58,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 197 [2023-08-30 02:52:58,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:58,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:58,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 197 [2023-08-30 02:52:58,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:58,434 INFO L130 PetriNetUnfolder]: 57/132 cut-off events. [2023-08-30 02:52:58,434 INFO L131 PetriNetUnfolder]: For 88/88 co-relation queries the response was YES. [2023-08-30 02:52:58,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 132 events. 57/132 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 447 event pairs, 12 based on Foata normal form. 10/141 useless extension candidates. Maximal degree in co-relation 398. Up to 43 conditions per place. [2023-08-30 02:52:58,435 INFO L137 encePairwiseOnDemand]: 192/197 looper letters, 27 selfloop transitions, 8 changer transitions 9/46 dead transitions. [2023-08-30 02:52:58,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 46 transitions, 262 flow [2023-08-30 02:52:58,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:52:58,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:52:58,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 639 transitions. [2023-08-30 02:52:58,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46337926033357507 [2023-08-30 02:52:58,438 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 639 transitions. [2023-08-30 02:52:58,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 639 transitions. [2023-08-30 02:52:58,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:58,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 639 transitions. [2023-08-30 02:52:58,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 91.28571428571429) internal successors, (639), 7 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:58,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:58,443 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:58,443 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 97 flow. Second operand 7 states and 639 transitions. [2023-08-30 02:52:58,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 46 transitions, 262 flow [2023-08-30 02:52:58,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 46 transitions, 251 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-30 02:52:58,448 INFO L231 Difference]: Finished difference. Result has 41 places, 23 transitions, 123 flow [2023-08-30 02:52:58,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=123, PETRI_PLACES=41, PETRI_TRANSITIONS=23} [2023-08-30 02:52:58,448 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2023-08-30 02:52:58,449 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 23 transitions, 123 flow [2023-08-30 02:52:58,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:58,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:58,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:52:58,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:52:58,450 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:58,450 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:58,450 INFO L85 PathProgramCache]: Analyzing trace with hash -2002556657, now seen corresponding path program 1 times [2023-08-30 02:52:58,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:52:58,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514357914] [2023-08-30 02:52:58,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:58,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:52:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:52:58,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:58,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:52:58,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514357914] [2023-08-30 02:52:58,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514357914] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:58,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:58,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:52:58,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207823561] [2023-08-30 02:52:58,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:58,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:52:58,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:52:58,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:52:58,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:52:58,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 197 [2023-08-30 02:52:58,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 23 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:58,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:58,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 197 [2023-08-30 02:52:58,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:59,137 INFO L130 PetriNetUnfolder]: 72/163 cut-off events. [2023-08-30 02:52:59,137 INFO L131 PetriNetUnfolder]: For 275/275 co-relation queries the response was YES. [2023-08-30 02:52:59,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 578 conditions, 163 events. 72/163 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 562 event pairs, 1 based on Foata normal form. 1/164 useless extension candidates. Maximal degree in co-relation 566. Up to 54 conditions per place. [2023-08-30 02:52:59,138 INFO L137 encePairwiseOnDemand]: 189/197 looper letters, 25 selfloop transitions, 8 changer transitions 26/59 dead transitions. [2023-08-30 02:52:59,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 59 transitions, 447 flow [2023-08-30 02:52:59,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:52:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:52:59,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 678 transitions. [2023-08-30 02:52:59,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4302030456852792 [2023-08-30 02:52:59,141 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 678 transitions. [2023-08-30 02:52:59,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 678 transitions. [2023-08-30 02:52:59,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:59,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 678 transitions. [2023-08-30 02:52:59,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 84.75) internal successors, (678), 8 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:59,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 197.0) internal successors, (1773), 9 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:59,146 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 197.0) internal successors, (1773), 9 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:59,147 INFO L175 Difference]: Start difference. First operand has 41 places, 23 transitions, 123 flow. Second operand 8 states and 678 transitions. [2023-08-30 02:52:59,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 59 transitions, 447 flow [2023-08-30 02:52:59,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 59 transitions, 380 flow, removed 14 selfloop flow, removed 6 redundant places. [2023-08-30 02:52:59,150 INFO L231 Difference]: Finished difference. Result has 43 places, 22 transitions, 110 flow [2023-08-30 02:52:59,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=110, PETRI_PLACES=43, PETRI_TRANSITIONS=22} [2023-08-30 02:52:59,150 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2023-08-30 02:52:59,151 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 22 transitions, 110 flow [2023-08-30 02:52:59,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:59,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:59,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:52:59,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:52:59,152 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:59,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:59,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1426004971, now seen corresponding path program 2 times [2023-08-30 02:52:59,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:52:59,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998212963] [2023-08-30 02:52:59,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:59,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:52:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:52:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:52:59,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:52:59,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998212963] [2023-08-30 02:52:59,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998212963] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:52:59,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:52:59,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:52:59,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901144258] [2023-08-30 02:52:59,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:52:59,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:52:59,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:52:59,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:52:59,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:52:59,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 197 [2023-08-30 02:52:59,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 22 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:59,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:52:59,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 197 [2023-08-30 02:52:59,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:52:59,474 INFO L130 PetriNetUnfolder]: 31/92 cut-off events. [2023-08-30 02:52:59,474 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2023-08-30 02:52:59,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 92 events. 31/92 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 252 event pairs, 10 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 311. Up to 38 conditions per place. [2023-08-30 02:52:59,475 INFO L137 encePairwiseOnDemand]: 192/197 looper letters, 17 selfloop transitions, 3 changer transitions 19/39 dead transitions. [2023-08-30 02:52:59,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 39 transitions, 271 flow [2023-08-30 02:52:59,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:52:59,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:52:59,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 527 transitions. [2023-08-30 02:52:59,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44585448392554994 [2023-08-30 02:52:59,478 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 527 transitions. [2023-08-30 02:52:59,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 527 transitions. [2023-08-30 02:52:59,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:52:59,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 527 transitions. [2023-08-30 02:52:59,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.83333333333333) internal successors, (527), 6 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:59,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:59,482 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:59,482 INFO L175 Difference]: Start difference. First operand has 43 places, 22 transitions, 110 flow. Second operand 6 states and 527 transitions. [2023-08-30 02:52:59,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 39 transitions, 271 flow [2023-08-30 02:52:59,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 39 transitions, 239 flow, removed 5 selfloop flow, removed 7 redundant places. [2023-08-30 02:52:59,484 INFO L231 Difference]: Finished difference. Result has 38 places, 18 transitions, 82 flow [2023-08-30 02:52:59,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=82, PETRI_PLACES=38, PETRI_TRANSITIONS=18} [2023-08-30 02:52:59,485 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2023-08-30 02:52:59,485 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 18 transitions, 82 flow [2023-08-30 02:52:59,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:52:59,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:52:59,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:52:59,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:52:59,486 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:52:59,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:52:59,486 INFO L85 PathProgramCache]: Analyzing trace with hash 464278629, now seen corresponding path program 3 times [2023-08-30 02:52:59,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:52:59,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729702666] [2023-08-30 02:52:59,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:52:59,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:52:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:52:59,526 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:52:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:52:59,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:52:59,586 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:52:59,587 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-08-30 02:52:59,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-08-30 02:52:59,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-30 02:52:59,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-08-30 02:52:59,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-30 02:52:59,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-30 02:52:59,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-30 02:52:59,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-08-30 02:52:59,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-08-30 02:52:59,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-30 02:52:59,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:52:59,591 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:52:59,595 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:52:59,596 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:52:59,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:52:59 BasicIcfg [2023-08-30 02:52:59,656 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:52:59,657 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:52:59,657 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:52:59,657 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:52:59,658 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:52:52" (3/4) ... [2023-08-30 02:52:59,660 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:52:59,660 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:52:59,661 INFO L158 Benchmark]: Toolchain (without parser) took 8773.07ms. Allocated memory was 86.0MB in the beginning and 151.0MB in the end (delta: 65.0MB). Free memory was 65.4MB in the beginning and 51.1MB in the end (delta: 14.3MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. [2023-08-30 02:52:59,661 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 65.0MB. Free memory is still 42.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:52:59,661 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.38ms. Allocated memory is still 86.0MB. Free memory was 65.2MB in the beginning and 62.5MB in the end (delta: 2.7MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2023-08-30 02:52:59,661 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.45ms. Allocated memory is still 86.0MB. Free memory was 62.5MB in the beginning and 60.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:52:59,662 INFO L158 Benchmark]: Boogie Preprocessor took 25.70ms. Allocated memory is still 86.0MB. Free memory was 60.0MB in the beginning and 58.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:52:59,662 INFO L158 Benchmark]: RCFGBuilder took 699.49ms. Allocated memory is still 86.0MB. Free memory was 58.3MB in the beginning and 52.3MB in the end (delta: 6.0MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2023-08-30 02:52:59,662 INFO L158 Benchmark]: TraceAbstraction took 7458.27ms. Allocated memory was 86.0MB in the beginning and 151.0MB in the end (delta: 65.0MB). Free memory was 51.4MB in the beginning and 52.2MB in the end (delta: -726.6kB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. [2023-08-30 02:52:59,662 INFO L158 Benchmark]: Witness Printer took 3.24ms. Allocated memory is still 151.0MB. Free memory was 52.2MB in the beginning and 51.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:52:59,664 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 65.0MB. Free memory is still 42.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 526.38ms. Allocated memory is still 86.0MB. Free memory was 65.2MB in the beginning and 62.5MB in the end (delta: 2.7MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.45ms. Allocated memory is still 86.0MB. Free memory was 62.5MB in the beginning and 60.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.70ms. Allocated memory is still 86.0MB. Free memory was 60.0MB in the beginning and 58.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 699.49ms. Allocated memory is still 86.0MB. Free memory was 58.3MB in the beginning and 52.3MB in the end (delta: 6.0MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7458.27ms. Allocated memory was 86.0MB in the beginning and 151.0MB in the end (delta: 65.0MB). Free memory was 51.4MB in the beginning and 52.2MB in the end (delta: -726.6kB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. * Witness Printer took 3.24ms. Allocated memory is still 151.0MB. Free memory was 52.2MB in the beginning and 51.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 103 PlacesBefore, 31 PlacesAfterwards, 98 TransitionsBefore, 25 TransitionsAfterwards, 1308 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, 3575 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1840, independent: 1688, independent conditional: 0, independent unconditional: 1688, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 693, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1840, independent: 1018, independent conditional: 0, independent unconditional: 1018, dependent: 129, dependent conditional: 0, dependent unconditional: 129, unknown: 693, unknown conditional: 0, unknown unconditional: 693] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$read_delayed; [L732] 0 int *z$read_delayed_var; [L733] 0 int z$w_buff0; [L734] 0 _Bool z$w_buff0_used; [L735] 0 int z$w_buff1; [L736] 0 _Bool z$w_buff1_used; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L817] 0 pthread_t t897; [L818] FCALL, FORK 0 pthread_create(&t897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t897, ((void *)0), P0, ((void *)0))=-1, t897={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 0 pthread_t t898; [L742] 1 z$w_buff1 = z$w_buff0 [L743] 1 z$w_buff0 = 1 [L744] 1 z$w_buff1_used = z$w_buff0_used [L745] 1 z$w_buff0_used = (_Bool)1 [L746] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L746] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L747] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L748] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L749] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t898, ((void *)0), P1, ((void *)0))=0, t897={5:0}, t898={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 [L776] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 z$flush_delayed = weak$$choice2 [L782] 2 z$mem_tmp = z [L783] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L784] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L785] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L786] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L787] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L789] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = z [L791] 2 z = z$flush_delayed ? z$mem_tmp : z [L792] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L795] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L796] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L797] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L798] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L799] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L824] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L824] RET 0 assume_abort_if_not(main$tmp_guard0) [L826] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t897={5:0}, t898={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L833] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L835] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 120 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 324 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 234 mSDsluCounter, 116 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 686 IncrementalHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 55 mSDtfsCounter, 686 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=7, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 531 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 02:52:59,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a8f8518887bc2e5e0d6d71e32a92b54f9a899d1e11c58bdb579bc81d5f31bb3 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:53:01,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:53:01,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:53:01,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:53:01,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:53:01,656 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:53:01,659 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:53:01,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:53:01,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:53:01,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:53:01,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:53:01,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:53:01,672 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:53:01,674 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:53:01,677 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:53:01,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:53:01,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:53:01,683 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:53:01,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:53:01,688 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:53:01,696 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:53:01,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:53:01,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:53:01,700 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:53:01,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:53:01,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:53:01,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:53:01,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:53:01,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:53:01,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:53:01,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:53:01,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:53:01,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:53:01,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:53:01,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:53:01,715 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:53:01,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:53:01,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:53:01,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:53:01,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:53:01,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:53:01,720 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 02:53:01,755 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:53:01,755 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:53:01,756 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:53:01,756 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:53:01,757 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:53:01,758 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:53:01,758 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:53:01,758 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:53:01,759 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:53:01,759 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:53:01,760 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:53:01,760 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:53:01,760 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:53:01,760 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:53:01,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:53:01,761 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:53:01,761 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:53:01,761 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:53:01,761 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:53:01,762 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:53:01,762 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 02:53:01,762 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 02:53:01,762 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:53:01,762 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:53:01,762 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:53:01,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:53:01,763 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:53:01,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:53:01,763 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:53:01,764 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:53:01,764 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 02:53:01,764 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 02:53:01,764 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:53:01,765 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:53:01,765 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:53:01,765 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 02:53:01,765 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:53:01,765 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 -> 3a8f8518887bc2e5e0d6d71e32a92b54f9a899d1e11c58bdb579bc81d5f31bb3 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 02:53:02,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:53:02,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:53:02,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:53:02,096 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:53:02,097 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:53:02,098 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-08-30 02:53:03,213 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:53:03,445 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:53:03,446 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-08-30 02:53:03,460 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b54f28c5a/dde157919e6048cbafecca7c91bfea11/FLAGeeedd3d50 [2023-08-30 02:53:03,474 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b54f28c5a/dde157919e6048cbafecca7c91bfea11 [2023-08-30 02:53:03,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:53:03,477 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:53:03,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:53:03,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:53:03,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:53:03,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:53:03" (1/1) ... [2023-08-30 02:53:03,486 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@384b0e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:03, skipping insertion in model container [2023-08-30 02:53:03,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:53:03" (1/1) ... [2023-08-30 02:53:03,493 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:53:03,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:53:03,740 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/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2023-08-30 02:53:03,962 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:53:03,980 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:53:03,992 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/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2023-08-30 02:53:04,031 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:53:04,077 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:53:04,078 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:53:04,084 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:53:04,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:04 WrapperNode [2023-08-30 02:53:04,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:53:04,086 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:53:04,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:53:04,086 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:53:04,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:04" (1/1) ... [2023-08-30 02:53:04,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:04" (1/1) ... [2023-08-30 02:53:04,155 INFO L138 Inliner]: procedures = 178, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 116 [2023-08-30 02:53:04,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:53:04,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:53:04,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:53:04,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:53:04,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:04" (1/1) ... [2023-08-30 02:53:04,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:04" (1/1) ... [2023-08-30 02:53:04,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:04" (1/1) ... [2023-08-30 02:53:04,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:04" (1/1) ... [2023-08-30 02:53:04,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:04" (1/1) ... [2023-08-30 02:53:04,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:04" (1/1) ... [2023-08-30 02:53:04,211 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:04" (1/1) ... [2023-08-30 02:53:04,217 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:04" (1/1) ... [2023-08-30 02:53:04,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:53:04,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:53:04,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:53:04,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:53:04,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:04" (1/1) ... [2023-08-30 02:53:04,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:53:04,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:53:04,258 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 02:53:04,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 02:53:04,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:53:04,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:53:04,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:53:04,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:53:04,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 02:53:04,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 02:53:04,298 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:53:04,298 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:53:04,298 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:53:04,298 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:53:04,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:53:04,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:53:04,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:53:04,300 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:53:04,474 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:53:04,476 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:53:04,864 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:53:04,998 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:53:04,998 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:53:05,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:53:05 BoogieIcfgContainer [2023-08-30 02:53:05,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:53:05,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:53:05,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:53:05,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:53:05,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:53:03" (1/3) ... [2023-08-30 02:53:05,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ee37b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:53:05, skipping insertion in model container [2023-08-30 02:53:05,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:04" (2/3) ... [2023-08-30 02:53:05,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ee37b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:53:05, skipping insertion in model container [2023-08-30 02:53:05,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:53:05" (3/3) ... [2023-08-30 02:53:05,008 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-08-30 02:53:05,029 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:53:05,029 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-30 02:53:05,030 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:53:05,090 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:53:05,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 101 transitions, 212 flow [2023-08-30 02:53:05,183 INFO L130 PetriNetUnfolder]: 2/99 cut-off events. [2023-08-30 02:53:05,184 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:53:05,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 99 events. 2/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-08-30 02:53:05,189 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 101 transitions, 212 flow [2023-08-30 02:53:05,193 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 99 transitions, 204 flow [2023-08-30 02:53:05,196 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:53:05,215 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 99 transitions, 204 flow [2023-08-30 02:53:05,220 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 99 transitions, 204 flow [2023-08-30 02:53:05,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 99 transitions, 204 flow [2023-08-30 02:53:05,254 INFO L130 PetriNetUnfolder]: 2/99 cut-off events. [2023-08-30 02:53:05,255 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:53:05,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 99 events. 2/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-08-30 02:53:05,257 INFO L119 LiptonReduction]: Number of co-enabled transitions 1308 [2023-08-30 02:53:10,413 INFO L134 LiptonReduction]: Checked pairs total: 3125 [2023-08-30 02:53:10,414 INFO L136 LiptonReduction]: Total number of compositions: 101 [2023-08-30 02:53:10,432 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:53:10,438 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;@7f5f32ac, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:53:10,439 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-30 02:53:10,442 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:53:10,442 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:53:10,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:10,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:53:10,445 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:53:10,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:10,451 INFO L85 PathProgramCache]: Analyzing trace with hash 457, now seen corresponding path program 1 times [2023-08-30 02:53:10,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:10,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205598081] [2023-08-30 02:53:10,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:10,463 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:53:10,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:10,468 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:53:10,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-30 02:53:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:10,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 02:53:10,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:53:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:53:10,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:53:10,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:53:10,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205598081] [2023-08-30 02:53:10,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [205598081] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:10,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:10,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:53:10,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351986399] [2023-08-30 02:53:10,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:10,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:53:10,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:53:10,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:53:10,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:53:10,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 202 [2023-08-30 02:53:10,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 52 flow. Second operand has 2 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:10,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:10,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 202 [2023-08-30 02:53:10,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:10,841 INFO L130 PetriNetUnfolder]: 273/466 cut-off events. [2023-08-30 02:53:10,841 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 02:53:10,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 946 conditions, 466 events. 273/466 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1817 event pairs, 273 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 936. Up to 465 conditions per place. [2023-08-30 02:53:10,847 INFO L137 encePairwiseOnDemand]: 198/202 looper letters, 18 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2023-08-30 02:53:10,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 19 transitions, 80 flow [2023-08-30 02:53:10,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:53:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:53:10,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 202 transitions. [2023-08-30 02:53:10,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-30 02:53:10,859 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 202 transitions. [2023-08-30 02:53:10,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 202 transitions. [2023-08-30 02:53:10,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:10,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 202 transitions. [2023-08-30 02:53:10,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:10,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:10,870 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:10,872 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 52 flow. Second operand 2 states and 202 transitions. [2023-08-30 02:53:10,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 19 transitions, 80 flow [2023-08-30 02:53:10,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 19 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:53:10,875 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 42 flow [2023-08-30 02:53:10,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2023-08-30 02:53:10,879 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -5 predicate places. [2023-08-30 02:53:10,880 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 42 flow [2023-08-30 02:53:10,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:10,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:10,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:53:10,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-30 02:53:11,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:53:11,089 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:53:11,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:11,090 INFO L85 PathProgramCache]: Analyzing trace with hash 447680, now seen corresponding path program 1 times [2023-08-30 02:53:11,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:11,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209177330] [2023-08-30 02:53:11,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:11,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:53:11,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:11,092 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:53:11,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-30 02:53:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:11,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:53:11,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:53:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:53:11,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:53:11,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:53:11,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209177330] [2023-08-30 02:53:11,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [209177330] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:11,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:11,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:53:11,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679806815] [2023-08-30 02:53:11,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:11,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:53:11,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:53:11,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:53:11,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:53:11,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 202 [2023-08-30 02:53:11,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:11,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:11,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 202 [2023-08-30 02:53:11,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:11,389 INFO L130 PetriNetUnfolder]: 211/402 cut-off events. [2023-08-30 02:53:11,390 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:53:11,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 779 conditions, 402 events. 211/402 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1810 event pairs, 25 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 776. Up to 301 conditions per place. [2023-08-30 02:53:11,392 INFO L137 encePairwiseOnDemand]: 199/202 looper letters, 25 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2023-08-30 02:53:11,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 30 transitions, 124 flow [2023-08-30 02:53:11,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:53:11,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:53:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2023-08-30 02:53:11,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4900990099009901 [2023-08-30 02:53:11,403 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 297 transitions. [2023-08-30 02:53:11,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 297 transitions. [2023-08-30 02:53:11,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:11,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 297 transitions. [2023-08-30 02:53:11,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:11,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:11,413 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:11,414 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 42 flow. Second operand 3 states and 297 transitions. [2023-08-30 02:53:11,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 30 transitions, 124 flow [2023-08-30 02:53:11,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 30 transitions, 124 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:53:11,415 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 42 flow [2023-08-30 02:53:11,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2023-08-30 02:53:11,416 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -4 predicate places. [2023-08-30 02:53:11,416 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 42 flow [2023-08-30 02:53:11,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:11,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:11,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:11,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-30 02:53:11,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:53:11,620 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:53:11,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:11,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1185830690, now seen corresponding path program 1 times [2023-08-30 02:53:11,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:11,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547445214] [2023-08-30 02:53:11,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:11,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:53:11,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:11,623 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:53:11,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-30 02:53:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:11,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:53:11,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:53:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:53:11,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:53:11,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:53:11,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547445214] [2023-08-30 02:53:11,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547445214] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:11,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:11,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:53:11,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548787253] [2023-08-30 02:53:11,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:11,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:53:11,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:53:11,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:53:11,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:53:11,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-08-30 02:53:11,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:11,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:11,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-08-30 02:53:11,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:11,927 INFO L130 PetriNetUnfolder]: 82/177 cut-off events. [2023-08-30 02:53:11,928 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-08-30 02:53:11,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 177 events. 82/177 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 640 event pairs, 16 based on Foata normal form. 24/191 useless extension candidates. Maximal degree in co-relation 381. Up to 89 conditions per place. [2023-08-30 02:53:11,929 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 23 selfloop transitions, 3 changer transitions 17/44 dead transitions. [2023-08-30 02:53:11,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 44 transitions, 190 flow [2023-08-30 02:53:11,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:53:11,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:53:11,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2023-08-30 02:53:11,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47029702970297027 [2023-08-30 02:53:11,933 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 475 transitions. [2023-08-30 02:53:11,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 475 transitions. [2023-08-30 02:53:11,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:11,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 475 transitions. [2023-08-30 02:53:11,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:11,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:11,939 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:11,939 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 42 flow. Second operand 5 states and 475 transitions. [2023-08-30 02:53:11,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 44 transitions, 190 flow [2023-08-30 02:53:11,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 44 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:53:11,940 INFO L231 Difference]: Finished difference. Result has 30 places, 19 transitions, 65 flow [2023-08-30 02:53:11,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=65, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2023-08-30 02:53:11,941 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2023-08-30 02:53:11,941 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 65 flow [2023-08-30 02:53:11,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:11,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:11,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:11,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-30 02:53:12,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:53:12,152 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:53:12,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:12,153 INFO L85 PathProgramCache]: Analyzing trace with hash -2005117274, now seen corresponding path program 1 times [2023-08-30 02:53:12,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:12,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279394884] [2023-08-30 02:53:12,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:12,154 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:53:12,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:12,155 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:53:12,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-30 02:53:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:12,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:53:12,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:53:12,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:53:12,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:53:12,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:53:12,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279394884] [2023-08-30 02:53:12,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279394884] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:12,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:12,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:53:12,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938458914] [2023-08-30 02:53:12,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:12,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:53:12,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:53:12,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:53:12,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:53:12,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-08-30 02:53:12,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 65 flow. Second operand has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:12,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:12,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-08-30 02:53:12,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:12,437 INFO L130 PetriNetUnfolder]: 28/76 cut-off events. [2023-08-30 02:53:12,437 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-08-30 02:53:12,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 76 events. 28/76 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 193 event pairs, 12 based on Foata normal form. 9/83 useless extension candidates. Maximal degree in co-relation 200. Up to 34 conditions per place. [2023-08-30 02:53:12,438 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 21 selfloop transitions, 5 changer transitions 9/36 dead transitions. [2023-08-30 02:53:12,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 36 transitions, 181 flow [2023-08-30 02:53:12,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:53:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:53:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 553 transitions. [2023-08-30 02:53:12,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45627062706270627 [2023-08-30 02:53:12,441 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 553 transitions. [2023-08-30 02:53:12,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 553 transitions. [2023-08-30 02:53:12,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:12,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 553 transitions. [2023-08-30 02:53:12,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:12,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:12,451 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:12,451 INFO L175 Difference]: Start difference. First operand has 30 places, 19 transitions, 65 flow. Second operand 6 states and 553 transitions. [2023-08-30 02:53:12,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 36 transitions, 181 flow [2023-08-30 02:53:12,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 168 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-30 02:53:12,453 INFO L231 Difference]: Finished difference. Result has 34 places, 19 transitions, 76 flow [2023-08-30 02:53:12,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=34, PETRI_TRANSITIONS=19} [2023-08-30 02:53:12,453 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2023-08-30 02:53:12,454 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 19 transitions, 76 flow [2023-08-30 02:53:12,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:12,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:12,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:12,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-30 02:53:12,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:53:12,664 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:53:12,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:12,665 INFO L85 PathProgramCache]: Analyzing trace with hash -2092972766, now seen corresponding path program 1 times [2023-08-30 02:53:12,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:12,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779920990] [2023-08-30 02:53:12,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:12,666 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:53:12,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:12,667 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:53:12,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-30 02:53:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:12,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-30 02:53:12,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:53:12,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:53:12,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:53:12,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:53:12,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779920990] [2023-08-30 02:53:12,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779920990] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:12,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:12,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:53:12,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912303385] [2023-08-30 02:53:12,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:12,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:53:12,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:53:12,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:53:12,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:53:12,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 202 [2023-08-30 02:53:12,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 19 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:12,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:12,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 202 [2023-08-30 02:53:12,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:13,096 INFO L130 PetriNetUnfolder]: 22/76 cut-off events. [2023-08-30 02:53:13,096 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2023-08-30 02:53:13,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 76 events. 22/76 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 206 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 204. Up to 29 conditions per place. [2023-08-30 02:53:13,097 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 34 selfloop transitions, 6 changer transitions 0/41 dead transitions. [2023-08-30 02:53:13,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 244 flow [2023-08-30 02:53:13,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:53:13,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:53:13,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 625 transitions. [2023-08-30 02:53:13,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.442008486562942 [2023-08-30 02:53:13,100 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 625 transitions. [2023-08-30 02:53:13,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 625 transitions. [2023-08-30 02:53:13,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:13,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 625 transitions. [2023-08-30 02:53:13,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 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-30 02:53:13,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:13,105 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:13,105 INFO L175 Difference]: Start difference. First operand has 34 places, 19 transitions, 76 flow. Second operand 7 states and 625 transitions. [2023-08-30 02:53:13,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 244 flow [2023-08-30 02:53:13,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 41 transitions, 212 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-30 02:53:13,107 INFO L231 Difference]: Finished difference. Result has 35 places, 21 transitions, 84 flow [2023-08-30 02:53:13,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=84, PETRI_PLACES=35, PETRI_TRANSITIONS=21} [2023-08-30 02:53:13,107 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2023-08-30 02:53:13,107 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 84 flow [2023-08-30 02:53:13,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:13,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:13,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:13,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-30 02:53:13,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:53:13,319 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:53:13,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:13,320 INFO L85 PathProgramCache]: Analyzing trace with hash 965363122, now seen corresponding path program 2 times [2023-08-30 02:53:13,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:13,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [110134545] [2023-08-30 02:53:13,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:53:13,320 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:53:13,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:13,321 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:53:13,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-30 02:53:13,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:53:13,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:53:13,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:53:13,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:53:13,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:53:13,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:53:13,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:53:13,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [110134545] [2023-08-30 02:53:13,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [110134545] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:13,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:13,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:53:13,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112875759] [2023-08-30 02:53:13,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:13,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:53:13,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:53:13,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:53:13,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:53:13,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-08-30 02:53:13,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 21 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:13,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:13,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-08-30 02:53:13,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:13,559 INFO L130 PetriNetUnfolder]: 37/118 cut-off events. [2023-08-30 02:53:13,559 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2023-08-30 02:53:13,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 118 events. 37/118 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 391 event pairs, 13 based on Foata normal form. 1/119 useless extension candidates. Maximal degree in co-relation 352. Up to 54 conditions per place. [2023-08-30 02:53:13,561 INFO L137 encePairwiseOnDemand]: 199/202 looper letters, 36 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2023-08-30 02:53:13,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 38 transitions, 233 flow [2023-08-30 02:53:13,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:53:13,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:53:13,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 375 transitions. [2023-08-30 02:53:13,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46410891089108913 [2023-08-30 02:53:13,563 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 375 transitions. [2023-08-30 02:53:13,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 375 transitions. [2023-08-30 02:53:13,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:13,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 375 transitions. [2023-08-30 02:53:13,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:13,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:13,566 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:13,567 INFO L175 Difference]: Start difference. First operand has 35 places, 21 transitions, 84 flow. Second operand 4 states and 375 transitions. [2023-08-30 02:53:13,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 38 transitions, 233 flow [2023-08-30 02:53:13,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 222 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:53:13,569 INFO L231 Difference]: Finished difference. Result has 37 places, 22 transitions, 91 flow [2023-08-30 02:53:13,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2023-08-30 02:53:13,570 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2023-08-30 02:53:13,570 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 91 flow [2023-08-30 02:53:13,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:13,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:13,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:13,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-30 02:53:13,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:53:13,781 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:53:13,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:13,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1806606498, now seen corresponding path program 1 times [2023-08-30 02:53:13,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:13,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269651286] [2023-08-30 02:53:13,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:13,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-30 02:53:13,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:13,783 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:53:13,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-30 02:53:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:13,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-30 02:53:13,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:53:14,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:53:14,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:53:14,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:53:14,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1269651286] [2023-08-30 02:53:14,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1269651286] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:14,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:14,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:53:14,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191848116] [2023-08-30 02:53:14,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:14,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:53:14,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:53:14,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:53:14,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:53:14,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 202 [2023-08-30 02:53:14,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:14,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:14,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 202 [2023-08-30 02:53:14,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:14,261 INFO L130 PetriNetUnfolder]: 31/102 cut-off events. [2023-08-30 02:53:14,261 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2023-08-30 02:53:14,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 102 events. 31/102 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 351 event pairs, 10 based on Foata normal form. 4/104 useless extension candidates. Maximal degree in co-relation 311. Up to 95 conditions per place. [2023-08-30 02:53:14,262 INFO L137 encePairwiseOnDemand]: 199/202 looper letters, 16 selfloop transitions, 2 changer transitions 5/24 dead transitions. [2023-08-30 02:53:14,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 24 transitions, 145 flow [2023-08-30 02:53:14,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:53:14,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:53:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 331 transitions. [2023-08-30 02:53:14,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40965346534653463 [2023-08-30 02:53:14,264 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 331 transitions. [2023-08-30 02:53:14,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 331 transitions. [2023-08-30 02:53:14,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:14,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 331 transitions. [2023-08-30 02:53:14,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 82.75) internal successors, (331), 4 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-30 02:53:14,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:14,268 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:14,268 INFO L175 Difference]: Start difference. First operand has 37 places, 22 transitions, 91 flow. Second operand 4 states and 331 transitions. [2023-08-30 02:53:14,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 24 transitions, 145 flow [2023-08-30 02:53:14,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 24 transitions, 144 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:53:14,270 INFO L231 Difference]: Finished difference. Result has 38 places, 18 transitions, 76 flow [2023-08-30 02:53:14,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=76, PETRI_PLACES=38, PETRI_TRANSITIONS=18} [2023-08-30 02:53:14,270 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2023-08-30 02:53:14,271 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 18 transitions, 76 flow [2023-08-30 02:53:14,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:14,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:14,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:14,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-30 02:53:14,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:53:14,484 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-30 02:53:14,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:14,484 INFO L85 PathProgramCache]: Analyzing trace with hash 829346844, now seen corresponding path program 3 times [2023-08-30 02:53:14,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:14,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412119239] [2023-08-30 02:53:14,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:53:14,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-30 02:53:14,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:14,486 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:53:14,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-30 02:53:14,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 02:53:14,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 02:53:14,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:53:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:53:14,661 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 02:53:14,662 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:53:14,663 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-08-30 02:53:14,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-08-30 02:53:14,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-30 02:53:14,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-08-30 02:53:14,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-30 02:53:14,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-30 02:53:14,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-30 02:53:14,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-08-30 02:53:14,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-08-30 02:53:14,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-30 02:53:14,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-30 02:53:14,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:53:14,866 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-08-30 02:53:14,871 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:53:14,871 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:53:14,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:53:14 BasicIcfg [2023-08-30 02:53:14,926 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:53:14,927 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:53:14,927 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:53:14,927 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:53:14,927 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:53:05" (3/4) ... [2023-08-30 02:53:14,929 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:53:14,929 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:53:14,930 INFO L158 Benchmark]: Toolchain (without parser) took 11452.60ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 59.1MB in the beginning and 25.8MB in the end (delta: 33.3MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2023-08-30 02:53:14,930 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 62.9MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:53:14,930 INFO L158 Benchmark]: CACSL2BoogieTranslator took 603.94ms. Allocated memory is still 79.7MB. Free memory was 58.8MB in the beginning and 55.4MB in the end (delta: 3.4MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2023-08-30 02:53:14,931 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.25ms. Allocated memory is still 79.7MB. Free memory was 55.4MB in the beginning and 53.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:53:14,931 INFO L158 Benchmark]: Boogie Preprocessor took 66.61ms. Allocated memory is still 79.7MB. Free memory was 53.0MB in the beginning and 50.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:53:14,931 INFO L158 Benchmark]: RCFGBuilder took 776.03ms. Allocated memory is still 79.7MB. Free memory was 50.9MB in the beginning and 36.2MB in the end (delta: 14.7MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2023-08-30 02:53:14,932 INFO L158 Benchmark]: TraceAbstraction took 9923.68ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 35.5MB in the beginning and 25.8MB in the end (delta: 9.7MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2023-08-30 02:53:14,932 INFO L158 Benchmark]: Witness Printer took 2.78ms. Allocated memory is still 96.5MB. Free memory is still 25.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:53:14,933 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 is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 603.94ms. Allocated memory is still 79.7MB. Free memory was 58.8MB in the beginning and 55.4MB in the end (delta: 3.4MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.25ms. Allocated memory is still 79.7MB. Free memory was 55.4MB in the beginning and 53.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.61ms. Allocated memory is still 79.7MB. Free memory was 53.0MB in the beginning and 50.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 776.03ms. Allocated memory is still 79.7MB. Free memory was 50.9MB in the beginning and 36.2MB in the end (delta: 14.7MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9923.68ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 35.5MB in the beginning and 25.8MB in the end (delta: 9.7MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * Witness Printer took 2.78ms. Allocated memory is still 96.5MB. Free memory is still 25.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 104 PlacesBefore, 30 PlacesAfterwards, 99 TransitionsBefore, 23 TransitionsAfterwards, 1308 CoEnabledTransitionPairs, 6 FixpointIterations, 49 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 101 TotalNumberOfCompositions, 3125 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1638, independent: 1510, independent conditional: 0, independent unconditional: 1510, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 702, independent: 676, independent conditional: 0, independent unconditional: 676, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1638, independent: 834, independent conditional: 0, independent unconditional: 834, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 702, unknown conditional: 0, unknown unconditional: 702] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$read_delayed; [L732] 0 int *z$read_delayed_var; [L733] 0 int z$w_buff0; [L734] 0 _Bool z$w_buff0_used; [L735] 0 int z$w_buff1; [L736] 0 _Bool z$w_buff1_used; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L817] 0 pthread_t t897; [L818] FCALL, FORK 0 pthread_create(&t897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t897, ((void *)0), P0, ((void *)0))=0, t897={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L742] 1 z$w_buff1 = z$w_buff0 [L743] 1 z$w_buff0 = 1 [L744] 1 z$w_buff1_used = z$w_buff0_used [L745] 1 z$w_buff0_used = (_Bool)1 [L746] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L746] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L747] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L748] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L749] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 0 pthread_t t898; [L820] FCALL, FORK 0 pthread_create(&t898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t898, ((void *)0), P1, ((void *)0))=1, t897={3:0}, t898={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 [L776] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 z$flush_delayed = weak$$choice2 [L782] 2 z$mem_tmp = z [L783] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L784] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L785] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L786] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L787] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L789] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = z [L791] 2 z = z$flush_delayed ? z$mem_tmp : z [L792] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L795] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L796] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L797] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L798] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L799] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L824] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L824] RET 0 assume_abort_if_not(main$tmp_guard0) [L826] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t897={3:0}, t898={7:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L833] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L835] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 121 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 183 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 135 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 516 IncrementalHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 15 mSDtfsCounter, 516 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=6, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 63 ConstructedInterpolants, 12 QuantifiedInterpolants, 522 SizeOfPredicates, 5 NumberOfNonLiveVariables, 660 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 02:53:14,959 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