./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:24:14,708 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:24:14,711 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:24:14,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:24:14,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:24:14,759 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:24:14,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:24:14,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:24:14,766 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:24:14,770 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:24:14,771 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:24:14,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:24:14,774 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:24:14,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:24:14,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:24:14,784 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:24:14,785 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:24:14,787 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:24:14,788 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:24:14,795 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:24:14,796 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:24:14,797 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:24:14,798 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:24:14,799 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:24:14,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:24:14,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:24:14,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:24:14,808 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:24:14,808 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:24:14,809 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:24:14,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:24:14,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:24:14,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:24:14,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:24:14,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:24:14,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:24:14,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:24:14,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:24:14,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:24:14,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:24:14,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:24:14,823 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:24:14,859 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:24:14,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:24:14,860 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:24:14,860 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:24:14,861 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:24:14,861 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:24:14,862 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:24:14,862 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:24:14,862 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:24:14,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:24:14,864 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:24:14,864 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:24:14,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:24:14,864 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:24:14,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:24:14,865 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:24:14,865 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:24:14,865 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:24:14,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:24:14,865 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:24:14,866 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:24:14,866 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:24:14,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:24:14,866 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:24:14,866 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:24:14,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:24:14,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:24:14,867 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:24:14,867 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:24:14,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:24:14,868 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:24:14,868 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:24:14,868 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:24:14,868 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:24:14,868 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 -> 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 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 -> BEFORE [2023-08-31 23:24:15,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:24:15,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:24:15,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:24:15,236 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:24:15,237 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:24:15,238 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-31 23:24:16,362 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:24:16,631 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:24:16,632 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-31 23:24:16,648 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3de4a1045/1f8a5ded410b4415bec6227ccd16af35/FLAG6e3d201c4 [2023-08-31 23:24:16,663 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3de4a1045/1f8a5ded410b4415bec6227ccd16af35 [2023-08-31 23:24:16,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:24:16,666 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:24:16,667 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:24:16,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:24:16,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:24:16,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:24:16" (1/1) ... [2023-08-31 23:24:16,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fc8dfdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:16, skipping insertion in model container [2023-08-31 23:24:16,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:24:16" (1/1) ... [2023-08-31 23:24:16,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:24:16,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:24:16,860 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2023-08-31 23:24:17,069 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:24:17,080 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:24:17,093 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2023-08-31 23:24:17,151 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:24:17,182 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:24:17,182 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:24:17,188 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:24:17,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:17 WrapperNode [2023-08-31 23:24:17,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:24:17,190 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:24:17,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:24:17,190 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:24:17,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:17" (1/1) ... [2023-08-31 23:24:17,225 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:17" (1/1) ... [2023-08-31 23:24:17,261 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2023-08-31 23:24:17,261 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:24:17,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:24:17,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:24:17,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:24:17,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:17" (1/1) ... [2023-08-31 23:24:17,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:17" (1/1) ... [2023-08-31 23:24:17,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:17" (1/1) ... [2023-08-31 23:24:17,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:17" (1/1) ... [2023-08-31 23:24:17,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:17" (1/1) ... [2023-08-31 23:24:17,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:17" (1/1) ... [2023-08-31 23:24:17,310 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:17" (1/1) ... [2023-08-31 23:24:17,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:17" (1/1) ... [2023-08-31 23:24:17,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:24:17,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:24:17,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:24:17,315 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:24:17,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:17" (1/1) ... [2023-08-31 23:24:17,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:24:17,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:24:17,358 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-31 23:24:17,378 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-31 23:24:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:24:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:24:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:24:17,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:24:17,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:24:17,392 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:24:17,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:24:17,392 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:24:17,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:24:17,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:24:17,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:24:17,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:24:17,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:24:17,394 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:24:17,575 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:24:17,577 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:24:17,875 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:24:18,110 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:24:18,111 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:24:18,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:24:18 BoogieIcfgContainer [2023-08-31 23:24:18,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:24:18,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:24:18,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:24:18,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:24:18,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:24:16" (1/3) ... [2023-08-31 23:24:18,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28da7321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:24:18, skipping insertion in model container [2023-08-31 23:24:18,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:17" (2/3) ... [2023-08-31 23:24:18,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28da7321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:24:18, skipping insertion in model container [2023-08-31 23:24:18,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:24:18" (3/3) ... [2023-08-31 23:24:18,121 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-31 23:24:18,137 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:24:18,137 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-31 23:24:18,137 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:24:18,204 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:24:18,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 95 transitions, 200 flow [2023-08-31 23:24:18,318 INFO L130 PetriNetUnfolder]: 2/93 cut-off events. [2023-08-31 23:24:18,319 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:24:18,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2023-08-31 23:24:18,323 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 95 transitions, 200 flow [2023-08-31 23:24:18,327 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 93 transitions, 192 flow [2023-08-31 23:24:18,330 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:24:18,340 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 93 transitions, 192 flow [2023-08-31 23:24:18,342 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 93 transitions, 192 flow [2023-08-31 23:24:18,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 93 transitions, 192 flow [2023-08-31 23:24:18,360 INFO L130 PetriNetUnfolder]: 2/93 cut-off events. [2023-08-31 23:24:18,360 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:24:18,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2023-08-31 23:24:18,362 INFO L119 LiptonReduction]: Number of co-enabled transitions 1138 [2023-08-31 23:24:22,865 INFO L134 LiptonReduction]: Checked pairs total: 2772 [2023-08-31 23:24:22,865 INFO L136 LiptonReduction]: Total number of compositions: 104 [2023-08-31 23:24:22,878 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:24:22,882 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;@68b82b7a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:24:22,883 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-31 23:24:22,885 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-31 23:24:22,885 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:24:22,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:22,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:24:22,886 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:24:22,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:22,891 INFO L85 PathProgramCache]: Analyzing trace with hash 442, now seen corresponding path program 1 times [2023-08-31 23:24:22,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:24:22,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858506103] [2023-08-31 23:24:22,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:22,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:24:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:24:23,037 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-31 23:24:23,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:24:23,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858506103] [2023-08-31 23:24:23,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858506103] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:23,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:23,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:24:23,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637312132] [2023-08-31 23:24:23,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:23,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:24:23,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:24:23,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:24:23,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:24:23,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 199 [2023-08-31 23:24:23,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 50 flow. Second operand has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:23,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:23,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 199 [2023-08-31 23:24:23,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:24:23,179 INFO L130 PetriNetUnfolder]: 173/307 cut-off events. [2023-08-31 23:24:23,179 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 23:24:23,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 307 events. 173/307 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1221 event pairs, 173 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 613. Up to 303 conditions per place. [2023-08-31 23:24:23,183 INFO L137 encePairwiseOnDemand]: 195/199 looper letters, 16 selfloop transitions, 0 changer transitions 0/18 dead transitions. [2023-08-31 23:24:23,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 18 transitions, 74 flow [2023-08-31 23:24:23,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:24:23,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:24:23,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 188 transitions. [2023-08-31 23:24:23,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4723618090452261 [2023-08-31 23:24:23,196 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 188 transitions. [2023-08-31 23:24:23,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 188 transitions. [2023-08-31 23:24:23,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:24:23,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 188 transitions. [2023-08-31 23:24:23,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 94.0) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:23,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:23,206 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:23,208 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 50 flow. Second operand 2 states and 188 transitions. [2023-08-31 23:24:23,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 18 transitions, 74 flow [2023-08-31 23:24:23,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:24:23,211 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 40 flow [2023-08-31 23:24:23,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2023-08-31 23:24:23,216 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -5 predicate places. [2023-08-31 23:24:23,216 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 40 flow [2023-08-31 23:24:23,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:23,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:23,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 23:24:23,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:24:23,217 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:24:23,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:23,218 INFO L85 PathProgramCache]: Analyzing trace with hash 418713828, now seen corresponding path program 1 times [2023-08-31 23:24:23,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:24:23,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314549455] [2023-08-31 23:24:23,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:23,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:24:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:24:23,539 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-31 23:24:23,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:24:23,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314549455] [2023-08-31 23:24:23,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314549455] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:23,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:23,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:24:23,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800009881] [2023-08-31 23:24:23,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:23,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:24:23,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:24:23,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:24:23,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:24:23,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 199 [2023-08-31 23:24:23,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:23,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:23,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 199 [2023-08-31 23:24:23,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:24:23,650 INFO L130 PetriNetUnfolder]: 135/266 cut-off events. [2023-08-31 23:24:23,650 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:24:23,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 266 events. 135/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1138 event pairs, 21 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 516. Up to 187 conditions per place. [2023-08-31 23:24:23,656 INFO L137 encePairwiseOnDemand]: 196/199 looper letters, 19 selfloop transitions, 2 changer transitions 2/25 dead transitions. [2023-08-31 23:24:23,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 25 transitions, 100 flow [2023-08-31 23:24:23,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:24:23,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:24:23,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2023-08-31 23:24:23,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.457286432160804 [2023-08-31 23:24:23,659 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 273 transitions. [2023-08-31 23:24:23,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 273 transitions. [2023-08-31 23:24:23,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:24:23,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 273 transitions. [2023-08-31 23:24:23,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:23,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:23,663 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:23,663 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 40 flow. Second operand 3 states and 273 transitions. [2023-08-31 23:24:23,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 25 transitions, 100 flow [2023-08-31 23:24:23,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:24:23,665 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2023-08-31 23:24:23,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-08-31 23:24:23,666 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -4 predicate places. [2023-08-31 23:24:23,666 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 40 flow [2023-08-31 23:24:23,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:23,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:23,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:24:23,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:24:23,667 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:24:23,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:23,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1342876313, now seen corresponding path program 1 times [2023-08-31 23:24:23,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:24:23,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035034072] [2023-08-31 23:24:23,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:23,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:24:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:24:24,043 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-31 23:24:24,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:24:24,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035034072] [2023-08-31 23:24:24,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035034072] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:24,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:24,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:24:24,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439112653] [2023-08-31 23:24:24,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:24,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:24:24,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:24:24,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:24:24,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:24:24,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 199 [2023-08-31 23:24:24,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 40 flow. Second operand has 4 states, 4 states have (on average 74.75) internal successors, (299), 4 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:24,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:24,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 199 [2023-08-31 23:24:24,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:24:24,168 INFO L130 PetriNetUnfolder]: 87/163 cut-off events. [2023-08-31 23:24:24,169 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-08-31 23:24:24,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 163 events. 87/163 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 540 event pairs, 68 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 350. Up to 155 conditions per place. [2023-08-31 23:24:24,170 INFO L137 encePairwiseOnDemand]: 196/199 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2023-08-31 23:24:24,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 18 transitions, 76 flow [2023-08-31 23:24:24,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:24:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:24:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 309 transitions. [2023-08-31 23:24:24,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38819095477386933 [2023-08-31 23:24:24,173 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 309 transitions. [2023-08-31 23:24:24,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 309 transitions. [2023-08-31 23:24:24,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:24:24,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 309 transitions. [2023-08-31 23:24:24,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:24,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:24,177 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:24,177 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 40 flow. Second operand 4 states and 309 transitions. [2023-08-31 23:24:24,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 18 transitions, 76 flow [2023-08-31 23:24:24,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:24:24,178 INFO L231 Difference]: Finished difference. Result has 24 places, 15 transitions, 38 flow [2023-08-31 23:24:24,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=38, PETRI_PLACES=24, PETRI_TRANSITIONS=15} [2023-08-31 23:24:24,179 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -5 predicate places. [2023-08-31 23:24:24,180 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 15 transitions, 38 flow [2023-08-31 23:24:24,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.75) internal successors, (299), 4 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:24,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:24,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:24:24,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:24:24,181 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:24:24,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:24,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1342876327, now seen corresponding path program 1 times [2023-08-31 23:24:24,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:24:24,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116102155] [2023-08-31 23:24:24,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:24,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:24:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:24:24,800 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-31 23:24:24,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:24:24,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116102155] [2023-08-31 23:24:24,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116102155] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:24,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:24,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:24:24,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451463938] [2023-08-31 23:24:24,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:24,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:24:24,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:24:24,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:24:24,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:24:24,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 199 [2023-08-31 23:24:24,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 15 transitions, 38 flow. Second operand has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:24,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:24,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 199 [2023-08-31 23:24:24,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:24:24,886 INFO L130 PetriNetUnfolder]: 109/213 cut-off events. [2023-08-31 23:24:24,886 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-31 23:24:24,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 213 events. 109/213 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 745 event pairs, 43 based on Foata normal form. 2/215 useless extension candidates. Maximal degree in co-relation 429. Up to 184 conditions per place. [2023-08-31 23:24:24,890 INFO L137 encePairwiseOnDemand]: 195/199 looper letters, 18 selfloop transitions, 3 changer transitions 0/22 dead transitions. [2023-08-31 23:24:24,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 22 transitions, 98 flow [2023-08-31 23:24:24,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:24:24,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:24:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2023-08-31 23:24:24,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489112227805695 [2023-08-31 23:24:24,893 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 268 transitions. [2023-08-31 23:24:24,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 268 transitions. [2023-08-31 23:24:24,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:24:24,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 268 transitions. [2023-08-31 23:24:24,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:24,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:24,900 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:24,900 INFO L175 Difference]: Start difference. First operand has 24 places, 15 transitions, 38 flow. Second operand 3 states and 268 transitions. [2023-08-31 23:24:24,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 22 transitions, 98 flow [2023-08-31 23:24:24,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 22 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:24:24,902 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 54 flow [2023-08-31 23:24:24,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=35, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2023-08-31 23:24:24,903 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -4 predicate places. [2023-08-31 23:24:24,903 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 54 flow [2023-08-31 23:24:24,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:24,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:24,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:24:24,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:24:24,904 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:24:24,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:24,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1320505085, now seen corresponding path program 1 times [2023-08-31 23:24:24,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:24:24,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602842438] [2023-08-31 23:24:24,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:24,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:24:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:24:25,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:24:25,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:24:25,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602842438] [2023-08-31 23:24:25,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602842438] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:25,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:25,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:24:25,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302246846] [2023-08-31 23:24:25,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:25,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:24:25,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:24:25,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:24:25,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:24:25,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 199 [2023-08-31 23:24:25,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:25,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:25,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 199 [2023-08-31 23:24:25,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:24:25,654 INFO L130 PetriNetUnfolder]: 105/207 cut-off events. [2023-08-31 23:24:25,654 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2023-08-31 23:24:25,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 207 events. 105/207 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 707 event pairs, 41 based on Foata normal form. 2/209 useless extension candidates. Maximal degree in co-relation 478. Up to 165 conditions per place. [2023-08-31 23:24:25,656 INFO L137 encePairwiseOnDemand]: 194/199 looper letters, 21 selfloop transitions, 5 changer transitions 0/27 dead transitions. [2023-08-31 23:24:25,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 27 transitions, 131 flow [2023-08-31 23:24:25,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:24:25,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:24:25,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2023-08-31 23:24:25,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.435929648241206 [2023-08-31 23:24:25,658 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 347 transitions. [2023-08-31 23:24:25,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 347 transitions. [2023-08-31 23:24:25,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:24:25,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 347 transitions. [2023-08-31 23:24:25,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:25,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:25,662 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:25,662 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 54 flow. Second operand 4 states and 347 transitions. [2023-08-31 23:24:25,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 27 transitions, 131 flow [2023-08-31 23:24:25,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 128 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:24:25,665 INFO L231 Difference]: Finished difference. Result has 28 places, 19 transitions, 76 flow [2023-08-31 23:24:25,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=76, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2023-08-31 23:24:25,667 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2023-08-31 23:24:25,667 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 76 flow [2023-08-31 23:24:25,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:25,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:25,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:24:25,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:24:25,669 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:24:25,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:25,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1048458265, now seen corresponding path program 1 times [2023-08-31 23:24:25,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:24:25,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409900170] [2023-08-31 23:24:25,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:25,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:24:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:24:26,113 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-31 23:24:26,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:24:26,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409900170] [2023-08-31 23:24:26,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409900170] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:26,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:26,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:24:26,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464919689] [2023-08-31 23:24:26,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:26,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:24:26,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:24:26,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:24:26,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:24:26,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 199 [2023-08-31 23:24:26,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:26,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:26,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 199 [2023-08-31 23:24:26,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:24:26,364 INFO L130 PetriNetUnfolder]: 127/229 cut-off events. [2023-08-31 23:24:26,364 INFO L131 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2023-08-31 23:24:26,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 229 events. 127/229 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 721 event pairs, 23 based on Foata normal form. 3/232 useless extension candidates. Maximal degree in co-relation 598. Up to 188 conditions per place. [2023-08-31 23:24:26,366 INFO L137 encePairwiseOnDemand]: 195/199 looper letters, 24 selfloop transitions, 5 changer transitions 0/29 dead transitions. [2023-08-31 23:24:26,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 159 flow [2023-08-31 23:24:26,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:24:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:24:26,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 312 transitions. [2023-08-31 23:24:26,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39195979899497485 [2023-08-31 23:24:26,369 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 312 transitions. [2023-08-31 23:24:26,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 312 transitions. [2023-08-31 23:24:26,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:24:26,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 312 transitions. [2023-08-31 23:24:26,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:26,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:26,372 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:26,372 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 76 flow. Second operand 4 states and 312 transitions. [2023-08-31 23:24:26,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 159 flow [2023-08-31 23:24:26,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 29 transitions, 150 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:24:26,374 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 95 flow [2023-08-31 23:24:26,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-08-31 23:24:26,374 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2023-08-31 23:24:26,375 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 95 flow [2023-08-31 23:24:26,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:26,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:26,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:24:26,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:24:26,376 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:24:26,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:26,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1777700145, now seen corresponding path program 1 times [2023-08-31 23:24:26,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:24:26,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305769588] [2023-08-31 23:24:26,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:26,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:24:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:24:27,224 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-31 23:24:27,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:24:27,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305769588] [2023-08-31 23:24:27,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305769588] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:27,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:27,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:24:27,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178731714] [2023-08-31 23:24:27,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:27,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:24:27,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:24:27,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:24:27,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:24:27,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 199 [2023-08-31 23:24:27,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 95 flow. Second operand has 6 states, 6 states have (on average 76.66666666666667) internal successors, (460), 6 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:27,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:27,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 199 [2023-08-31 23:24:27,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:24:27,388 INFO L130 PetriNetUnfolder]: 131/239 cut-off events. [2023-08-31 23:24:27,388 INFO L131 PetriNetUnfolder]: For 211/211 co-relation queries the response was YES. [2023-08-31 23:24:27,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 239 events. 131/239 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 776 event pairs, 19 based on Foata normal form. 4/243 useless extension candidates. Maximal degree in co-relation 674. Up to 170 conditions per place. [2023-08-31 23:24:27,391 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 29 selfloop transitions, 8 changer transitions 0/37 dead transitions. [2023-08-31 23:24:27,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 216 flow [2023-08-31 23:24:27,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:24:27,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:24:27,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 408 transitions. [2023-08-31 23:24:27,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4100502512562814 [2023-08-31 23:24:27,393 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 408 transitions. [2023-08-31 23:24:27,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 408 transitions. [2023-08-31 23:24:27,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:24:27,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 408 transitions. [2023-08-31 23:24:27,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:27,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:27,398 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:27,398 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 95 flow. Second operand 5 states and 408 transitions. [2023-08-31 23:24:27,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 216 flow [2023-08-31 23:24:27,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 209 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-31 23:24:27,402 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 135 flow [2023-08-31 23:24:27,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2023-08-31 23:24:27,403 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2023-08-31 23:24:27,403 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 135 flow [2023-08-31 23:24:27,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.66666666666667) internal successors, (460), 6 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:27,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:27,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:24:27,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:24:27,404 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:24:27,405 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:27,405 INFO L85 PathProgramCache]: Analyzing trace with hash 573387962, now seen corresponding path program 1 times [2023-08-31 23:24:27,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:24:27,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951065929] [2023-08-31 23:24:27,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:27,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:24:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:24:27,623 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-31 23:24:27,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:24:27,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951065929] [2023-08-31 23:24:27,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951065929] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:27,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:27,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:24:27,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503017499] [2023-08-31 23:24:27,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:27,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:24:27,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:24:27,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:24:27,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:24:27,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 199 [2023-08-31 23:24:27,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:27,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:27,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 199 [2023-08-31 23:24:27,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:24:27,716 INFO L130 PetriNetUnfolder]: 60/138 cut-off events. [2023-08-31 23:24:27,716 INFO L131 PetriNetUnfolder]: For 178/185 co-relation queries the response was YES. [2023-08-31 23:24:27,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 138 events. 60/138 cut-off events. For 178/185 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 494 event pairs, 10 based on Foata normal form. 23/160 useless extension candidates. Maximal degree in co-relation 439. Up to 62 conditions per place. [2023-08-31 23:24:27,718 INFO L137 encePairwiseOnDemand]: 194/199 looper letters, 25 selfloop transitions, 5 changer transitions 16/52 dead transitions. [2023-08-31 23:24:27,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 52 transitions, 340 flow [2023-08-31 23:24:27,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:24:27,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:24:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 436 transitions. [2023-08-31 23:24:27,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4381909547738693 [2023-08-31 23:24:27,720 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 436 transitions. [2023-08-31 23:24:27,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 436 transitions. [2023-08-31 23:24:27,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:24:27,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 436 transitions. [2023-08-31 23:24:27,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:27,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:27,723 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:27,723 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 135 flow. Second operand 5 states and 436 transitions. [2023-08-31 23:24:27,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 52 transitions, 340 flow [2023-08-31 23:24:27,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 335 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-31 23:24:27,729 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 170 flow [2023-08-31 23:24:27,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-31 23:24:27,731 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 13 predicate places. [2023-08-31 23:24:27,731 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 170 flow [2023-08-31 23:24:27,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:27,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:27,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:24:27,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:24:27,732 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:24:27,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:27,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1722507857, now seen corresponding path program 1 times [2023-08-31 23:24:27,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:24:27,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865940591] [2023-08-31 23:24:27,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:27,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:24:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:24:27,934 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-31 23:24:27,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:24:27,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865940591] [2023-08-31 23:24:27,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865940591] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:27,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:27,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:24:27,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733434474] [2023-08-31 23:24:27,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:27,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:24:27,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:24:27,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:24:27,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:24:27,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 199 [2023-08-31 23:24:27,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:27,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:27,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 199 [2023-08-31 23:24:27,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:24:28,032 INFO L130 PetriNetUnfolder]: 40/98 cut-off events. [2023-08-31 23:24:28,033 INFO L131 PetriNetUnfolder]: For 148/151 co-relation queries the response was YES. [2023-08-31 23:24:28,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 98 events. 40/98 cut-off events. For 148/151 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 307 event pairs, 7 based on Foata normal form. 10/107 useless extension candidates. Maximal degree in co-relation 362. Up to 33 conditions per place. [2023-08-31 23:24:28,034 INFO L137 encePairwiseOnDemand]: 194/199 looper letters, 23 selfloop transitions, 7 changer transitions 14/50 dead transitions. [2023-08-31 23:24:28,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 361 flow [2023-08-31 23:24:28,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:24:28,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:24:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 595 transitions. [2023-08-31 23:24:28,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4271356783919598 [2023-08-31 23:24:28,037 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 595 transitions. [2023-08-31 23:24:28,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 595 transitions. [2023-08-31 23:24:28,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:24:28,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 595 transitions. [2023-08-31 23:24:28,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 85.0) internal successors, (595), 7 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:28,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:28,041 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:28,042 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 170 flow. Second operand 7 states and 595 transitions. [2023-08-31 23:24:28,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 361 flow [2023-08-31 23:24:28,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 50 transitions, 342 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-31 23:24:28,045 INFO L231 Difference]: Finished difference. Result has 47 places, 28 transitions, 177 flow [2023-08-31 23:24:28,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=177, PETRI_PLACES=47, PETRI_TRANSITIONS=28} [2023-08-31 23:24:28,046 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 18 predicate places. [2023-08-31 23:24:28,046 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 28 transitions, 177 flow [2023-08-31 23:24:28,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:28,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:28,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:24:28,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:24:28,047 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:24:28,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:28,048 INFO L85 PathProgramCache]: Analyzing trace with hash 990779066, now seen corresponding path program 1 times [2023-08-31 23:24:28,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:24:28,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970865509] [2023-08-31 23:24:28,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:28,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:24:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:24:28,277 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-31 23:24:28,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:24:28,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970865509] [2023-08-31 23:24:28,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970865509] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:28,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:28,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:24:28,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861183257] [2023-08-31 23:24:28,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:28,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:24:28,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:24:28,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:24:28,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:24:28,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 199 [2023-08-31 23:24:28,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 28 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:28,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:28,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 199 [2023-08-31 23:24:28,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:24:28,368 INFO L130 PetriNetUnfolder]: 56/136 cut-off events. [2023-08-31 23:24:28,369 INFO L131 PetriNetUnfolder]: For 333/334 co-relation queries the response was YES. [2023-08-31 23:24:28,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 136 events. 56/136 cut-off events. For 333/334 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 485 event pairs, 5 based on Foata normal form. 2/138 useless extension candidates. Maximal degree in co-relation 543. Up to 69 conditions per place. [2023-08-31 23:24:28,370 INFO L137 encePairwiseOnDemand]: 196/199 looper letters, 20 selfloop transitions, 1 changer transitions 24/47 dead transitions. [2023-08-31 23:24:28,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 384 flow [2023-08-31 23:24:28,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:24:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:24:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 348 transitions. [2023-08-31 23:24:28,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4371859296482412 [2023-08-31 23:24:28,372 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 348 transitions. [2023-08-31 23:24:28,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 348 transitions. [2023-08-31 23:24:28,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:24:28,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 348 transitions. [2023-08-31 23:24:28,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:28,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:28,376 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:28,376 INFO L175 Difference]: Start difference. First operand has 47 places, 28 transitions, 177 flow. Second operand 4 states and 348 transitions. [2023-08-31 23:24:28,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 384 flow [2023-08-31 23:24:28,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 47 transitions, 341 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-31 23:24:28,379 INFO L231 Difference]: Finished difference. Result has 46 places, 21 transitions, 117 flow [2023-08-31 23:24:28,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=46, PETRI_TRANSITIONS=21} [2023-08-31 23:24:28,380 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 17 predicate places. [2023-08-31 23:24:28,380 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 21 transitions, 117 flow [2023-08-31 23:24:28,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:28,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:28,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:24:28,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:24:28,381 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:24:28,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:28,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1041001392, now seen corresponding path program 2 times [2023-08-31 23:24:28,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:24:28,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591455046] [2023-08-31 23:24:28,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:28,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:24:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:24:29,221 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-31 23:24:29,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:24:29,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591455046] [2023-08-31 23:24:29,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591455046] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:29,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:29,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:24:29,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200187441] [2023-08-31 23:24:29,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:29,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:24:29,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:24:29,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:24:29,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:24:29,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 199 [2023-08-31 23:24:29,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 21 transitions, 117 flow. Second operand has 8 states, 8 states have (on average 74.875) internal successors, (599), 8 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:29,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:29,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 199 [2023-08-31 23:24:29,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:24:29,420 INFO L130 PetriNetUnfolder]: 12/47 cut-off events. [2023-08-31 23:24:29,420 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2023-08-31 23:24:29,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 47 events. 12/47 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 77 event pairs, 3 based on Foata normal form. 1/48 useless extension candidates. Maximal degree in co-relation 178. Up to 19 conditions per place. [2023-08-31 23:24:29,421 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 14 selfloop transitions, 6 changer transitions 12/32 dead transitions. [2023-08-31 23:24:29,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 32 transitions, 241 flow [2023-08-31 23:24:29,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:24:29,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:24:29,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 539 transitions. [2023-08-31 23:24:29,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3869346733668342 [2023-08-31 23:24:29,423 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 539 transitions. [2023-08-31 23:24:29,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 539 transitions. [2023-08-31 23:24:29,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:24:29,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 539 transitions. [2023-08-31 23:24:29,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 77.0) internal successors, (539), 7 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:29,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:29,427 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:29,428 INFO L175 Difference]: Start difference. First operand has 46 places, 21 transitions, 117 flow. Second operand 7 states and 539 transitions. [2023-08-31 23:24:29,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 32 transitions, 241 flow [2023-08-31 23:24:29,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 32 transitions, 211 flow, removed 7 selfloop flow, removed 9 redundant places. [2023-08-31 23:24:29,429 INFO L231 Difference]: Finished difference. Result has 40 places, 19 transitions, 99 flow [2023-08-31 23:24:29,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=99, PETRI_PLACES=40, PETRI_TRANSITIONS=19} [2023-08-31 23:24:29,430 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 11 predicate places. [2023-08-31 23:24:29,431 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 19 transitions, 99 flow [2023-08-31 23:24:29,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 74.875) internal successors, (599), 8 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:29,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:29,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:24:29,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:24:29,432 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:24:29,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:29,433 INFO L85 PathProgramCache]: Analyzing trace with hash -655625840, now seen corresponding path program 3 times [2023-08-31 23:24:29,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:24:29,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247971117] [2023-08-31 23:24:29,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:29,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:24:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:24:29,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:24:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:24:29,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:24:29,545 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:24:29,546 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-08-31 23:24:29,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-08-31 23:24:29,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-31 23:24:29,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-08-31 23:24:29,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-31 23:24:29,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-31 23:24:29,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-31 23:24:29,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-08-31 23:24:29,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-08-31 23:24:29,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-31 23:24:29,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:24:29,549 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:24:29,554 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:24:29,554 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:24:29,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:24:29 BasicIcfg [2023-08-31 23:24:29,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:24:29,616 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:24:29,616 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:24:29,616 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:24:29,617 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:24:18" (3/4) ... [2023-08-31 23:24:29,620 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:24:29,620 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:24:29,621 INFO L158 Benchmark]: Toolchain (without parser) took 12954.66ms. Allocated memory was 79.7MB in the beginning and 230.7MB in the end (delta: 151.0MB). Free memory was 54.7MB in the beginning and 121.5MB in the end (delta: -66.8MB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. [2023-08-31 23:24:29,621 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 60.8MB. Free memory is still 38.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:24:29,621 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.26ms. Allocated memory is still 79.7MB. Free memory was 54.7MB in the beginning and 50.8MB in the end (delta: 3.9MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2023-08-31 23:24:29,621 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.19ms. Allocated memory is still 79.7MB. Free memory was 50.8MB in the beginning and 48.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:24:29,622 INFO L158 Benchmark]: Boogie Preprocessor took 51.93ms. Allocated memory is still 79.7MB. Free memory was 48.0MB in the beginning and 46.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:24:29,622 INFO L158 Benchmark]: RCFGBuilder took 799.27ms. Allocated memory is still 79.7MB. Free memory was 46.3MB in the beginning and 41.8MB in the end (delta: 4.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-08-31 23:24:29,622 INFO L158 Benchmark]: TraceAbstraction took 11499.97ms. Allocated memory was 79.7MB in the beginning and 230.7MB in the end (delta: 151.0MB). Free memory was 40.9MB in the beginning and 122.6MB in the end (delta: -81.7MB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. [2023-08-31 23:24:29,623 INFO L158 Benchmark]: Witness Printer took 4.38ms. Allocated memory is still 230.7MB. Free memory was 122.6MB in the beginning and 121.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:24:29,624 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.25ms. Allocated memory is still 60.8MB. Free memory is still 38.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.26ms. Allocated memory is still 79.7MB. Free memory was 54.7MB in the beginning and 50.8MB in the end (delta: 3.9MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.19ms. Allocated memory is still 79.7MB. Free memory was 50.8MB in the beginning and 48.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.93ms. Allocated memory is still 79.7MB. Free memory was 48.0MB in the beginning and 46.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 799.27ms. Allocated memory is still 79.7MB. Free memory was 46.3MB in the beginning and 41.8MB in the end (delta: 4.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11499.97ms. Allocated memory was 79.7MB in the beginning and 230.7MB in the end (delta: 151.0MB). Free memory was 40.9MB in the beginning and 122.6MB in the end (delta: -81.7MB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. * Witness Printer took 4.38ms. Allocated memory is still 230.7MB. Free memory was 122.6MB in the beginning and 121.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 98 PlacesBefore, 29 PlacesAfterwards, 93 TransitionsBefore, 22 TransitionsAfterwards, 1138 CoEnabledTransitionPairs, 6 FixpointIterations, 47 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 104 TotalNumberOfCompositions, 2772 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1441, independent: 1323, independent conditional: 0, independent unconditional: 1323, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 672, independent: 641, independent conditional: 0, independent unconditional: 641, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1441, independent: 682, independent conditional: 0, independent unconditional: 682, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 672, unknown conditional: 0, unknown unconditional: 672] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1447; [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1447, ((void *)0), P0, ((void *)0))=-1, t1447={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L794] 0 pthread_t t1448; [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1448, ((void *)0), P1, ((void *)0))=0, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L760] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=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: 790]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 795]: 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: 793]: 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, 113 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: 11.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 313 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 233 mSDsluCounter, 124 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 647 IncrementalHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 34 mSDtfsCounter, 647 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=9, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 1012 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-31 23:24:29,659 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:24:31,574 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:24:31,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:24:31,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:24:31,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:24:31,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:24:31,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:24:31,605 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:24:31,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:24:31,613 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:24:31,615 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:24:31,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:24:31,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:24:31,620 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:24:31,622 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:24:31,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:24:31,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:24:31,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:24:31,629 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:24:31,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:24:31,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:24:31,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:24:31,639 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:24:31,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:24:31,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:24:31,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:24:31,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:24:31,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:24:31,651 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:24:31,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:24:31,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:24:31,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:24:31,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:24:31,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:24:31,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:24:31,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:24:31,658 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:24:31,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:24:31,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:24:31,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:24:31,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:24:31,662 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:24:31,719 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:24:31,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:24:31,721 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:24:31,721 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:24:31,722 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:24:31,722 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:24:31,723 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:24:31,723 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:24:31,723 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:24:31,723 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:24:31,724 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:24:31,725 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:24:31,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:24:31,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:24:31,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:24:31,725 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:24:31,726 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:24:31,726 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:24:31,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:24:31,726 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:24:31,726 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:24:31,727 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:24:31,727 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:24:31,727 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:24:31,727 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:24:31,727 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:24:31,728 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:24:31,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:24:31,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:24:31,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:24:31,729 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:24:31,729 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:24:31,729 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:24:31,729 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:24:31,730 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:24:31,730 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:24:31,730 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:24:31,730 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 -> 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 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 -> BEFORE [2023-08-31 23:24:32,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:24:32,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:24:32,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:24:32,089 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:24:32,090 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:24:32,091 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-31 23:24:33,352 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:24:33,647 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:24:33,648 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-31 23:24:33,661 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf0bc3c51/f2a880e1610f4ceb8cf08e38e9ea24ab/FLAGeb285240a [2023-08-31 23:24:33,673 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf0bc3c51/f2a880e1610f4ceb8cf08e38e9ea24ab [2023-08-31 23:24:33,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:24:33,677 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:24:33,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:24:33,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:24:33,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:24:33,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:24:33" (1/1) ... [2023-08-31 23:24:33,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4af63f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:33, skipping insertion in model container [2023-08-31 23:24:33,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:24:33" (1/1) ... [2023-08-31 23:24:33,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:24:33,737 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:24:33,903 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2023-08-31 23:24:34,110 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:24:34,123 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:24:34,135 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2023-08-31 23:24:34,190 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:24:34,228 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:24:34,229 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:24:34,234 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:24:34,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:34 WrapperNode [2023-08-31 23:24:34,235 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:24:34,236 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:24:34,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:24:34,237 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:24:34,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:34" (1/1) ... [2023-08-31 23:24:34,280 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:34" (1/1) ... [2023-08-31 23:24:34,311 INFO L138 Inliner]: procedures = 178, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2023-08-31 23:24:34,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:24:34,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:24:34,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:24:34,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:24:34,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:34" (1/1) ... [2023-08-31 23:24:34,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:34" (1/1) ... [2023-08-31 23:24:34,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:34" (1/1) ... [2023-08-31 23:24:34,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:34" (1/1) ... [2023-08-31 23:24:34,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:34" (1/1) ... [2023-08-31 23:24:34,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:34" (1/1) ... [2023-08-31 23:24:34,357 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:34" (1/1) ... [2023-08-31 23:24:34,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:34" (1/1) ... [2023-08-31 23:24:34,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:24:34,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:24:34,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:24:34,370 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:24:34,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:34" (1/1) ... [2023-08-31 23:24:34,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:24:34,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:24:34,401 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-31 23:24:34,407 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-31 23:24:34,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:24:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:24:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:24:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:24:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:24:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:24:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:24:34,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:24:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:24:34,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:24:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:24:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:24:34,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:24:34,444 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:24:34,628 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:24:34,630 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:24:34,904 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:24:35,051 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:24:35,052 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:24:35,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:24:35 BoogieIcfgContainer [2023-08-31 23:24:35,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:24:35,056 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:24:35,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:24:35,059 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:24:35,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:24:33" (1/3) ... [2023-08-31 23:24:35,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a56652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:24:35, skipping insertion in model container [2023-08-31 23:24:35,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:34" (2/3) ... [2023-08-31 23:24:35,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a56652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:24:35, skipping insertion in model container [2023-08-31 23:24:35,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:24:35" (3/3) ... [2023-08-31 23:24:35,061 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-31 23:24:35,077 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:24:35,077 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-31 23:24:35,077 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:24:35,140 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:24:35,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 96 transitions, 202 flow [2023-08-31 23:24:35,233 INFO L130 PetriNetUnfolder]: 2/94 cut-off events. [2023-08-31 23:24:35,234 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:24:35,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2023-08-31 23:24:35,240 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 96 transitions, 202 flow [2023-08-31 23:24:35,245 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 94 transitions, 194 flow [2023-08-31 23:24:35,248 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:24:35,260 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 94 transitions, 194 flow [2023-08-31 23:24:35,264 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 94 transitions, 194 flow [2023-08-31 23:24:35,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 94 transitions, 194 flow [2023-08-31 23:24:35,299 INFO L130 PetriNetUnfolder]: 2/94 cut-off events. [2023-08-31 23:24:35,299 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:24:35,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2023-08-31 23:24:35,301 INFO L119 LiptonReduction]: Number of co-enabled transitions 1138 [2023-08-31 23:24:41,133 INFO L134 LiptonReduction]: Checked pairs total: 2825 [2023-08-31 23:24:41,134 INFO L136 LiptonReduction]: Total number of compositions: 100 [2023-08-31 23:24:41,187 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:24:41,192 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;@71bc8821, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:24:41,193 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-31 23:24:41,194 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:24:41,194 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:24:41,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:41,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:24:41,202 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:24:41,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:41,206 INFO L85 PathProgramCache]: Analyzing trace with hash 441, now seen corresponding path program 1 times [2023-08-31 23:24:41,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:24:41,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422820384] [2023-08-31 23:24:41,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:41,216 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-31 23:24:41,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:24:41,223 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-31 23:24:41,230 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-31 23:24:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:24:41,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:24:41,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:24:41,298 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-31 23:24:41,298 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:24:41,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:24:41,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422820384] [2023-08-31 23:24:41,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422820384] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:41,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:41,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:24:41,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230433990] [2023-08-31 23:24:41,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:41,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:24:41,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:24:41,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:24:41,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:24:41,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 196 [2023-08-31 23:24:41,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 50 flow. Second operand has 2 states, 2 states have (on average 85.5) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:41,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:41,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 196 [2023-08-31 23:24:41,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:24:41,480 INFO L130 PetriNetUnfolder]: 173/306 cut-off events. [2023-08-31 23:24:41,480 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-31 23:24:41,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 306 events. 173/306 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1231 event pairs, 173 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 612. Up to 303 conditions per place. [2023-08-31 23:24:41,484 INFO L137 encePairwiseOnDemand]: 192/196 looper letters, 16 selfloop transitions, 0 changer transitions 0/18 dead transitions. [2023-08-31 23:24:41,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 18 transitions, 74 flow [2023-08-31 23:24:41,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:24:41,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:24:41,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 190 transitions. [2023-08-31 23:24:41,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4846938775510204 [2023-08-31 23:24:41,495 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 190 transitions. [2023-08-31 23:24:41,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 190 transitions. [2023-08-31 23:24:41,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:24:41,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 190 transitions. [2023-08-31 23:24:41,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 95.0) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:41,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:41,506 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:41,518 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 50 flow. Second operand 2 states and 190 transitions. [2023-08-31 23:24:41,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 18 transitions, 74 flow [2023-08-31 23:24:41,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:24:41,522 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 40 flow [2023-08-31 23:24:41,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2023-08-31 23:24:41,526 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -5 predicate places. [2023-08-31 23:24:41,526 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 40 flow [2023-08-31 23:24:41,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 85.5) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:41,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:41,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 23:24:41,551 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-31 23:24:41,735 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-31 23:24:41,736 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:24:41,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:41,737 INFO L85 PathProgramCache]: Analyzing trace with hash 415998098, now seen corresponding path program 1 times [2023-08-31 23:24:41,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:24:41,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893888081] [2023-08-31 23:24:41,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:41,738 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-31 23:24:41,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:24:41,739 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-31 23:24:41,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-31 23:24:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:24:41,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:24:41,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:24:41,849 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-31 23:24:41,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:24:41,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:24:41,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893888081] [2023-08-31 23:24:41,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893888081] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:41,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:41,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:24:41,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843794960] [2023-08-31 23:24:41,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:41,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:24:41,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:24:41,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:24:41,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:24:41,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 196 [2023-08-31 23:24:41,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:41,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:41,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 196 [2023-08-31 23:24:41,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:24:41,987 INFO L130 PetriNetUnfolder]: 135/265 cut-off events. [2023-08-31 23:24:41,987 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:24:41,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 265 events. 135/265 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1144 event pairs, 21 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 515. Up to 187 conditions per place. [2023-08-31 23:24:41,990 INFO L137 encePairwiseOnDemand]: 193/196 looper letters, 19 selfloop transitions, 2 changer transitions 2/25 dead transitions. [2023-08-31 23:24:41,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 25 transitions, 100 flow [2023-08-31 23:24:41,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:24:41,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:24:41,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 276 transitions. [2023-08-31 23:24:41,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2023-08-31 23:24:41,993 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 276 transitions. [2023-08-31 23:24:41,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 276 transitions. [2023-08-31 23:24:41,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:24:41,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 276 transitions. [2023-08-31 23:24:41,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:41,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:41,998 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:41,999 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 40 flow. Second operand 3 states and 276 transitions. [2023-08-31 23:24:41,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 25 transitions, 100 flow [2023-08-31 23:24:41,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:24:42,000 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2023-08-31 23:24:42,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-08-31 23:24:42,001 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -4 predicate places. [2023-08-31 23:24:42,001 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 40 flow [2023-08-31 23:24:42,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:42,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:42,002 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:24:42,015 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-31 23:24:42,210 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-31 23:24:42,211 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:24:42,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:42,211 INFO L85 PathProgramCache]: Analyzing trace with hash 342282992, now seen corresponding path program 1 times [2023-08-31 23:24:42,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:24:42,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818560692] [2023-08-31 23:24:42,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:42,213 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-31 23:24:42,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:24:42,216 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-31 23:24:42,230 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-31 23:24:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:24:42,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:24:42,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:24:42,360 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-31 23:24:42,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:24:42,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:24:42,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818560692] [2023-08-31 23:24:42,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818560692] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:42,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:42,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:24:42,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83308649] [2023-08-31 23:24:42,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:42,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:24:42,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:24:42,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:24:42,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:24:42,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 196 [2023-08-31 23:24:42,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 40 flow. Second operand has 4 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-31 23:24:42,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:42,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 196 [2023-08-31 23:24:42,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:24:42,520 INFO L130 PetriNetUnfolder]: 56/129 cut-off events. [2023-08-31 23:24:42,520 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-08-31 23:24:42,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 129 events. 56/129 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 452 event pairs, 12 based on Foata normal form. 16/137 useless extension candidates. Maximal degree in co-relation 277. Up to 69 conditions per place. [2023-08-31 23:24:42,524 INFO L137 encePairwiseOnDemand]: 191/196 looper letters, 19 selfloop transitions, 3 changer transitions 13/37 dead transitions. [2023-08-31 23:24:42,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 37 transitions, 160 flow [2023-08-31 23:24:42,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:24:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:24:42,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2023-08-31 23:24:42,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45102040816326533 [2023-08-31 23:24:42,531 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 442 transitions. [2023-08-31 23:24:42,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 442 transitions. [2023-08-31 23:24:42,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:24:42,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 442 transitions. [2023-08-31 23:24:42,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:42,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:42,540 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:42,540 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 40 flow. Second operand 5 states and 442 transitions. [2023-08-31 23:24:42,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 37 transitions, 160 flow [2023-08-31 23:24:42,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 37 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:24:42,541 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 63 flow [2023-08-31 23:24:42,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=63, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2023-08-31 23:24:42,543 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2023-08-31 23:24:42,543 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 63 flow [2023-08-31 23:24:42,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-31 23:24:42,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:42,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:24:42,555 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-31 23:24:42,753 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-31 23:24:42,753 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:24:42,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:42,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1994255376, now seen corresponding path program 1 times [2023-08-31 23:24:42,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:24:42,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919370170] [2023-08-31 23:24:42,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:42,755 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-31 23:24:42,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:24:42,758 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-31 23:24:42,761 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-31 23:24:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:24:42,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:24:42,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:24:42,860 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-31 23:24:42,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:24:42,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:24:42,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919370170] [2023-08-31 23:24:42,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919370170] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:42,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:42,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:24:42,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153221413] [2023-08-31 23:24:42,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:42,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:24:42,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:24:42,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:24:42,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:24:42,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 196 [2023-08-31 23:24:42,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 63 flow. Second operand has 5 states, 5 states have (on average 83.0) internal successors, (415), 5 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:42,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:42,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 196 [2023-08-31 23:24:42,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:24:42,983 INFO L130 PetriNetUnfolder]: 20/60 cut-off events. [2023-08-31 23:24:42,983 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-31 23:24:42,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 60 events. 20/60 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 145 event pairs, 8 based on Foata normal form. 7/65 useless extension candidates. Maximal degree in co-relation 160. Up to 24 conditions per place. [2023-08-31 23:24:42,984 INFO L137 encePairwiseOnDemand]: 191/196 looper letters, 17 selfloop transitions, 5 changer transitions 7/31 dead transitions. [2023-08-31 23:24:42,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 159 flow [2023-08-31 23:24:42,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:24:42,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:24:42,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 517 transitions. [2023-08-31 23:24:42,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43962585034013607 [2023-08-31 23:24:42,992 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 517 transitions. [2023-08-31 23:24:42,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 517 transitions. [2023-08-31 23:24:42,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:24:42,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 517 transitions. [2023-08-31 23:24:42,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:42,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 196.0) internal successors, (1372), 7 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:42,996 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 196.0) internal successors, (1372), 7 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:42,996 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 63 flow. Second operand 6 states and 517 transitions. [2023-08-31 23:24:42,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 159 flow [2023-08-31 23:24:42,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 31 transitions, 146 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-31 23:24:42,998 INFO L231 Difference]: Finished difference. Result has 33 places, 18 transitions, 74 flow [2023-08-31 23:24:42,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=33, PETRI_TRANSITIONS=18} [2023-08-31 23:24:42,999 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2023-08-31 23:24:42,999 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 18 transitions, 74 flow [2023-08-31 23:24:42,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.0) internal successors, (415), 5 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:42,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:43,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:24:43,023 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-31 23:24:43,214 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-31 23:24:43,214 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:24:43,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:43,214 INFO L85 PathProgramCache]: Analyzing trace with hash -818584856, now seen corresponding path program 1 times [2023-08-31 23:24:43,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:24:43,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590474438] [2023-08-31 23:24:43,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:43,215 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-31 23:24:43,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:24:43,216 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-31 23:24:43,217 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-31 23:24:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:24:43,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:24:43,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:24:43,354 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-31 23:24:43,354 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:24:43,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:24:43,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590474438] [2023-08-31 23:24:43,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590474438] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:43,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:43,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:24:43,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933288232] [2023-08-31 23:24:43,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:43,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:24:43,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:24:43,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:24:43,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:24:43,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 196 [2023-08-31 23:24:43,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 18 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 84.5) internal successors, (338), 4 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:43,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:43,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 196 [2023-08-31 23:24:43,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:24:43,457 INFO L130 PetriNetUnfolder]: 21/73 cut-off events. [2023-08-31 23:24:43,457 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2023-08-31 23:24:43,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 73 events. 21/73 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 211 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 199. Up to 40 conditions per place. [2023-08-31 23:24:43,458 INFO L137 encePairwiseOnDemand]: 193/196 looper letters, 30 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2023-08-31 23:24:43,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 205 flow [2023-08-31 23:24:43,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:24:43,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:24:43,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 353 transitions. [2023-08-31 23:24:43,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4502551020408163 [2023-08-31 23:24:43,460 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 353 transitions. [2023-08-31 23:24:43,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 353 transitions. [2023-08-31 23:24:43,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:24:43,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 353 transitions. [2023-08-31 23:24:43,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:43,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:43,464 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:43,464 INFO L175 Difference]: Start difference. First operand has 33 places, 18 transitions, 74 flow. Second operand 4 states and 353 transitions. [2023-08-31 23:24:43,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 205 flow [2023-08-31 23:24:43,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 33 transitions, 174 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-31 23:24:43,466 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 71 flow [2023-08-31 23:24:43,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=71, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2023-08-31 23:24:43,467 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2023-08-31 23:24:43,467 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 71 flow [2023-08-31 23:24:43,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.5) internal successors, (338), 4 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:43,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:43,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:24:43,481 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-31 23:24:43,668 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-31 23:24:43,669 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:24:43,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:43,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1592964152, now seen corresponding path program 2 times [2023-08-31 23:24:43,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:24:43,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355451441] [2023-08-31 23:24:43,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:24:43,670 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-31 23:24:43,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:24:43,671 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-31 23:24:43,672 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-31 23:24:43,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:24:43,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:24:43,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-31 23:24:43,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:24:44,015 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-31 23:24:44,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:24:44,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:24:44,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355451441] [2023-08-31 23:24:44,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1355451441] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:44,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:44,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:24:44,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708003546] [2023-08-31 23:24:44,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:44,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:24:44,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:24:44,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:24:44,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:24:44,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 196 [2023-08-31 23:24:44,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 71 flow. Second operand has 8 states, 8 states have (on average 81.75) internal successors, (654), 8 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:44,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:44,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 196 [2023-08-31 23:24:44,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:24:44,174 INFO L130 PetriNetUnfolder]: 28/101 cut-off events. [2023-08-31 23:24:44,174 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2023-08-31 23:24:44,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 101 events. 28/101 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 342 event pairs, 3 based on Foata normal form. 1/102 useless extension candidates. Maximal degree in co-relation 283. Up to 44 conditions per place. [2023-08-31 23:24:44,175 INFO L137 encePairwiseOnDemand]: 191/196 looper letters, 27 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2023-08-31 23:24:44,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 34 transitions, 190 flow [2023-08-31 23:24:44,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:24:44,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:24:44,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2023-08-31 23:24:44,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4377551020408163 [2023-08-31 23:24:44,178 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 429 transitions. [2023-08-31 23:24:44,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 429 transitions. [2023-08-31 23:24:44,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:24:44,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 429 transitions. [2023-08-31 23:24:44,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:44,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:44,181 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:44,181 INFO L175 Difference]: Start difference. First operand has 31 places, 19 transitions, 71 flow. Second operand 5 states and 429 transitions. [2023-08-31 23:24:44,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 34 transitions, 190 flow [2023-08-31 23:24:44,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 34 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:24:44,183 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 94 flow [2023-08-31 23:24:44,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2023-08-31 23:24:44,184 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2023-08-31 23:24:44,184 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 21 transitions, 94 flow [2023-08-31 23:24:44,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 81.75) internal successors, (654), 8 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:44,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:44,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:24:44,197 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-31 23:24:44,397 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-31 23:24:44,398 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:24:44,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:44,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1592964138, now seen corresponding path program 1 times [2023-08-31 23:24:44,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:24:44,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831366733] [2023-08-31 23:24:44,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:44,400 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-31 23:24:44,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:24:44,403 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-31 23:24:44,445 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-31 23:24:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:24:44,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-31 23:24:44,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:24:44,741 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-31 23:24:44,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:24:44,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:24:44,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831366733] [2023-08-31 23:24:44,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [831366733] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:44,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:44,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:24:44,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489317029] [2023-08-31 23:24:44,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:44,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:24:44,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:24:44,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:24:44,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:24:44,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 196 [2023-08-31 23:24:44,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 21 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:44,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:44,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 196 [2023-08-31 23:24:44,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:24:44,892 INFO L130 PetriNetUnfolder]: 24/88 cut-off events. [2023-08-31 23:24:44,893 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2023-08-31 23:24:44,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 88 events. 24/88 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 285 event pairs, 14 based on Foata normal form. 4/91 useless extension candidates. Maximal degree in co-relation 274. Up to 74 conditions per place. [2023-08-31 23:24:44,893 INFO L137 encePairwiseOnDemand]: 193/196 looper letters, 13 selfloop transitions, 2 changer transitions 6/23 dead transitions. [2023-08-31 23:24:44,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 23 transitions, 142 flow [2023-08-31 23:24:44,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:24:44,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:24:44,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 309 transitions. [2023-08-31 23:24:44,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39413265306122447 [2023-08-31 23:24:44,895 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 309 transitions. [2023-08-31 23:24:44,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 309 transitions. [2023-08-31 23:24:44,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:24:44,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 309 transitions. [2023-08-31 23:24:44,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:44,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:44,898 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:44,898 INFO L175 Difference]: Start difference. First operand has 36 places, 21 transitions, 94 flow. Second operand 4 states and 309 transitions. [2023-08-31 23:24:44,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 23 transitions, 142 flow [2023-08-31 23:24:44,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 23 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:24:44,900 INFO L231 Difference]: Finished difference. Result has 36 places, 17 transitions, 76 flow [2023-08-31 23:24:44,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=76, PETRI_PLACES=36, PETRI_TRANSITIONS=17} [2023-08-31 23:24:44,901 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2023-08-31 23:24:44,901 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 17 transitions, 76 flow [2023-08-31 23:24:44,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:44,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:44,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:24:44,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-08-31 23:24:45,111 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-31 23:24:45,112 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:24:45,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:45,112 INFO L85 PathProgramCache]: Analyzing trace with hash -311615944, now seen corresponding path program 3 times [2023-08-31 23:24:45,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:24:45,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802313656] [2023-08-31 23:24:45,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:24:45,113 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-31 23:24:45,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:24:45,114 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-31 23:24:45,116 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-31 23:24:45,200 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:24:45,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:24:45,201 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:24:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:24:45,282 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:24:45,282 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:24:45,283 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-08-31 23:24:45,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-08-31 23:24:45,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-31 23:24:45,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-08-31 23:24:45,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-31 23:24:45,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-31 23:24:45,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-31 23:24:45,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-08-31 23:24:45,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-08-31 23:24:45,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-31 23:24:45,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-08-31 23:24:45,499 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-31 23:24:45,500 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-08-31 23:24:45,504 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:24:45,504 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:24:45,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:24:45 BasicIcfg [2023-08-31 23:24:45,557 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:24:45,558 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:24:45,558 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:24:45,558 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:24:45,558 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:24:35" (3/4) ... [2023-08-31 23:24:45,565 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:24:45,566 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:24:45,566 INFO L158 Benchmark]: Toolchain (without parser) took 11889.50ms. Allocated memory was 79.7MB in the beginning and 98.6MB in the end (delta: 18.9MB). Free memory was 54.9MB in the beginning and 27.5MB in the end (delta: 27.4MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. [2023-08-31 23:24:45,566 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 54.5MB. Free memory is still 32.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:24:45,567 INFO L158 Benchmark]: CACSL2BoogieTranslator took 557.92ms. Allocated memory is still 79.7MB. Free memory was 54.9MB in the beginning and 51.4MB in the end (delta: 3.5MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2023-08-31 23:24:45,567 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.29ms. Allocated memory is still 79.7MB. Free memory was 51.4MB in the beginning and 49.0MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:24:45,567 INFO L158 Benchmark]: Boogie Preprocessor took 55.82ms. Allocated memory is still 79.7MB. Free memory was 49.0MB in the beginning and 46.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:24:45,568 INFO L158 Benchmark]: RCFGBuilder took 684.67ms. Allocated memory is still 79.7MB. Free memory was 46.9MB in the beginning and 33.7MB in the end (delta: 13.2MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2023-08-31 23:24:45,568 INFO L158 Benchmark]: TraceAbstraction took 10501.33ms. Allocated memory was 79.7MB in the beginning and 98.6MB in the end (delta: 18.9MB). Free memory was 33.3MB in the beginning and 28.6MB in the end (delta: 4.7MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2023-08-31 23:24:45,569 INFO L158 Benchmark]: Witness Printer took 8.04ms. Allocated memory is still 98.6MB. Free memory was 28.6MB in the beginning and 27.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:24:45,570 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 54.5MB. Free memory is still 32.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 557.92ms. Allocated memory is still 79.7MB. Free memory was 54.9MB in the beginning and 51.4MB in the end (delta: 3.5MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.29ms. Allocated memory is still 79.7MB. Free memory was 51.4MB in the beginning and 49.0MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.82ms. Allocated memory is still 79.7MB. Free memory was 49.0MB in the beginning and 46.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 684.67ms. Allocated memory is still 79.7MB. Free memory was 46.9MB in the beginning and 33.7MB in the end (delta: 13.2MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10501.33ms. Allocated memory was 79.7MB in the beginning and 98.6MB in the end (delta: 18.9MB). Free memory was 33.3MB in the beginning and 28.6MB in the end (delta: 4.7MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * Witness Printer took 8.04ms. Allocated memory is still 98.6MB. Free memory was 28.6MB in the beginning and 27.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 99 PlacesBefore, 29 PlacesAfterwards, 94 TransitionsBefore, 22 TransitionsAfterwards, 1138 CoEnabledTransitionPairs, 6 FixpointIterations, 46 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 100 TotalNumberOfCompositions, 2825 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1399, independent: 1282, independent conditional: 0, independent unconditional: 1282, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 658, independent: 629, independent conditional: 0, independent unconditional: 629, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1399, independent: 653, independent conditional: 0, independent unconditional: 653, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 658, unknown conditional: 0, unknown unconditional: 658] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 40, Positive conditional cache size: 0, Positive unconditional cache size: 40, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1447; [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1447, ((void *)0), P0, ((void *)0))=0, t1447={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L794] 0 pthread_t t1448; [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1448, ((void *)0), P1, ((void *)0))=1, t1447={3:0}, t1448={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L760] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447={3:0}, t1448={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=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: 790]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 795]: 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: 793]: 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, 114 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: 10.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 435 IncrementalHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 19 mSDtfsCounter, 435 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=6, InterpolantAutomatonStates: 29, 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.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 62 ConstructedInterpolants, 12 QuantifiedInterpolants, 582 SizeOfPredicates, 5 NumberOfNonLiveVariables, 661 ConjunctsInSsa, 49 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-31 23:24:45,589 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