./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 48c4b734419752ee9918164f01e542b34e2482d2668432fb42f6f1192b7f0b6a --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:51:12,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:51:12,315 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:51:12,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:51:12,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:51:12,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:51:12,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:51:12,354 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:51:12,356 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:51:12,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:51:12,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:51:12,364 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:51:12,364 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:51:12,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:51:12,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:51:12,372 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:51:12,375 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:51:12,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:51:12,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:51:12,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:51:12,382 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:51:12,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:51:12,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:51:12,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:51:12,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:51:12,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:51:12,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:51:12,394 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:51:12,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:51:12,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:51:12,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:51:12,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:51:12,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:51:12,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:51:12,404 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:51:12,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:51:12,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:51:12,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:51:12,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:51:12,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:51:12,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:51:12,409 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 20:51:12,442 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:51:12,443 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:51:12,444 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:51:12,444 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:51:12,445 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:51:12,445 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:51:12,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:51:12,446 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:51:12,446 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:51:12,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:51:12,447 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:51:12,447 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:51:12,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:51:12,447 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:51:12,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:51:12,448 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:51:12,448 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:51:12,448 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:51:12,448 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:51:12,448 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:51:12,449 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:51:12,449 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:51:12,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:51:12,449 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:51:12,449 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:51:12,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:51:12,450 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:51:12,450 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:51:12,450 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:51:12,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:51:12,451 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:51:12,451 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:51:12,451 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:51:12,451 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:51:12,451 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 -> 48c4b734419752ee9918164f01e542b34e2482d2668432fb42f6f1192b7f0b6a Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:51:12,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:51:12,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:51:12,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:51:12,809 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:51:12,810 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:51:12,810 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-29 20:51:14,022 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:51:14,281 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:51:14,281 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-29 20:51:14,294 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a838604/bc38d49c0766468eb1e7843705714bec/FLAG89d5e8a0e [2023-08-29 20:51:14,306 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a838604/bc38d49c0766468eb1e7843705714bec [2023-08-29 20:51:14,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:51:14,310 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:51:14,316 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:51:14,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:51:14,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:51:14,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:51:14" (1/1) ... [2023-08-29 20:51:14,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@320b941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:14, skipping insertion in model container [2023-08-29 20:51:14,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:51:14" (1/1) ... [2023-08-29 20:51:14,329 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:51:14,369 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:51:14,481 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/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-08-29 20:51:14,652 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:51:14,672 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:51:14,688 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/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-08-29 20:51:14,757 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:51:14,787 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:51:14,787 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:51:14,793 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:51:14,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:14 WrapperNode [2023-08-29 20:51:14,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:51:14,795 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:51:14,795 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:51:14,795 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:51:14,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:14" (1/1) ... [2023-08-29 20:51:14,832 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:14" (1/1) ... [2023-08-29 20:51:14,869 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 112 [2023-08-29 20:51:14,869 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:51:14,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:51:14,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:51:14,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:51:14,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:14" (1/1) ... [2023-08-29 20:51:14,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:14" (1/1) ... [2023-08-29 20:51:14,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:14" (1/1) ... [2023-08-29 20:51:14,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:14" (1/1) ... [2023-08-29 20:51:14,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:14" (1/1) ... [2023-08-29 20:51:14,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:14" (1/1) ... [2023-08-29 20:51:14,888 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:14" (1/1) ... [2023-08-29 20:51:14,889 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:14" (1/1) ... [2023-08-29 20:51:14,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:51:14,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:51:14,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:51:14,893 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:51:14,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:14" (1/1) ... [2023-08-29 20:51:14,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:51:14,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:51:14,943 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:51:14,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:51:14,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:51:14,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:51:14,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:51:14,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:51:14,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:51:14,987 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:51:14,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:51:14,987 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:51:14,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:51:14,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:51:14,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:51:14,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:51:14,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:51:14,989 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:51:15,141 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:51:15,143 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:51:15,417 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:51:15,553 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:51:15,554 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:51:15,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:51:15 BoogieIcfgContainer [2023-08-29 20:51:15,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:51:15,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:51:15,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:51:15,561 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:51:15,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:51:14" (1/3) ... [2023-08-29 20:51:15,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dbed817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:51:15, skipping insertion in model container [2023-08-29 20:51:15,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:14" (2/3) ... [2023-08-29 20:51:15,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dbed817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:51:15, skipping insertion in model container [2023-08-29 20:51:15,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:51:15" (3/3) ... [2023-08-29 20:51:15,564 INFO L112 eAbstractionObserver]: Analyzing ICFG safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-29 20:51:15,579 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:51:15,580 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-29 20:51:15,580 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:51:15,645 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:51:15,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 94 transitions, 198 flow [2023-08-29 20:51:15,739 INFO L130 PetriNetUnfolder]: 2/92 cut-off events. [2023-08-29 20:51:15,739 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:15,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2023-08-29 20:51:15,744 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 94 transitions, 198 flow [2023-08-29 20:51:15,748 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 92 transitions, 190 flow [2023-08-29 20:51:15,752 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:51:15,762 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 92 transitions, 190 flow [2023-08-29 20:51:15,765 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 92 transitions, 190 flow [2023-08-29 20:51:15,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 92 transitions, 190 flow [2023-08-29 20:51:15,793 INFO L130 PetriNetUnfolder]: 2/92 cut-off events. [2023-08-29 20:51:15,793 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:15,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2023-08-29 20:51:15,795 INFO L119 LiptonReduction]: Number of co-enabled transitions 1044 [2023-08-29 20:51:19,309 INFO L134 LiptonReduction]: Checked pairs total: 2318 [2023-08-29 20:51:19,309 INFO L136 LiptonReduction]: Total number of compositions: 98 [2023-08-29 20:51:19,334 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:51:19,341 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;@5f364697, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:51:19,341 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-29 20:51:19,343 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:51:19,344 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:19,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:19,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:51:19,345 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-29 20:51:19,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:19,350 INFO L85 PathProgramCache]: Analyzing trace with hash 427, now seen corresponding path program 1 times [2023-08-29 20:51:19,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:19,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391349902] [2023-08-29 20:51:19,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:19,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:19,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:19,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:19,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391349902] [2023-08-29 20:51:19,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391349902] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:19,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:19,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:51:19,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925519476] [2023-08-29 20:51:19,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:19,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:51:19,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:19,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:51:19,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:51:19,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 192 [2023-08-29 20:51:19,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 48 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-29 20:51:19,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:19,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 192 [2023-08-29 20:51:19,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:19,620 INFO L130 PetriNetUnfolder]: 173/305 cut-off events. [2023-08-29 20:51:19,621 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 20:51:19,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 305 events. 173/305 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1159 event pairs, 173 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 611. Up to 303 conditions per place. [2023-08-29 20:51:19,627 INFO L137 encePairwiseOnDemand]: 188/192 looper letters, 16 selfloop transitions, 0 changer transitions 0/17 dead transitions. [2023-08-29 20:51:19,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 17 transitions, 72 flow [2023-08-29 20:51:19,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:51:19,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:51:19,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 188 transitions. [2023-08-29 20:51:19,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333 [2023-08-29 20:51:19,640 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 188 transitions. [2023-08-29 20:51:19,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 188 transitions. [2023-08-29 20:51:19,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:19,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 188 transitions. [2023-08-29 20:51:19,645 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-29 20:51:19,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:19,650 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:19,651 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 48 flow. Second operand 2 states and 188 transitions. [2023-08-29 20:51:19,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 17 transitions, 72 flow [2023-08-29 20:51:19,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 17 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:51:19,654 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 38 flow [2023-08-29 20:51:19,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=38, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2023-08-29 20:51:19,659 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, -5 predicate places. [2023-08-29 20:51:19,659 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 38 flow [2023-08-29 20:51:19,659 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-29 20:51:19,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:19,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:51:19,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:51:19,660 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-29 20:51:19,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:19,661 INFO L85 PathProgramCache]: Analyzing trace with hash 402695433, now seen corresponding path program 1 times [2023-08-29 20:51:19,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:19,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293425726] [2023-08-29 20:51:19,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:19,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:19,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:19,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:19,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293425726] [2023-08-29 20:51:19,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293425726] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:19,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:19,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:51:19,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754474867] [2023-08-29 20:51:19,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:19,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:51:19,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:19,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:51:19,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:51:19,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 192 [2023-08-29 20:51:19,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 38 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-29 20:51:19,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:19,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 192 [2023-08-29 20:51:19,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:20,094 INFO L130 PetriNetUnfolder]: 135/264 cut-off events. [2023-08-29 20:51:20,096 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:20,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 264 events. 135/264 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1068 event pairs, 21 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 514. Up to 187 conditions per place. [2023-08-29 20:51:20,102 INFO L137 encePairwiseOnDemand]: 189/192 looper letters, 19 selfloop transitions, 2 changer transitions 2/24 dead transitions. [2023-08-29 20:51:20,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 24 transitions, 98 flow [2023-08-29 20:51:20,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:51:20,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:51:20,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2023-08-29 20:51:20,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4739583333333333 [2023-08-29 20:51:20,109 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 273 transitions. [2023-08-29 20:51:20,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 273 transitions. [2023-08-29 20:51:20,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:20,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 273 transitions. [2023-08-29 20:51:20,114 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-29 20:51:20,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:20,118 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:20,118 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 38 flow. Second operand 3 states and 273 transitions. [2023-08-29 20:51:20,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 24 transitions, 98 flow [2023-08-29 20:51:20,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 24 transitions, 98 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:51:20,120 INFO L231 Difference]: Finished difference. Result has 24 places, 15 transitions, 38 flow [2023-08-29 20:51:20,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=24, PETRI_TRANSITIONS=15} [2023-08-29 20:51:20,121 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, -4 predicate places. [2023-08-29 20:51:20,121 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 15 transitions, 38 flow [2023-08-29 20:51:20,121 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-29 20:51:20,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:20,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:20,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:51:20,122 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-29 20:51:20,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:20,123 INFO L85 PathProgramCache]: Analyzing trace with hash 443305148, now seen corresponding path program 1 times [2023-08-29 20:51:20,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:20,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270474557] [2023-08-29 20:51:20,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:20,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:20,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:20,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:20,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270474557] [2023-08-29 20:51:20,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270474557] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:20,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:20,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:51:20,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404611503] [2023-08-29 20:51:20,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:20,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:51:20,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:20,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:51:20,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:51:20,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 192 [2023-08-29 20:51:20,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 15 transitions, 38 flow. Second operand has 4 states, 4 states have (on average 75.75) internal successors, (303), 4 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:20,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:20,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 192 [2023-08-29 20:51:20,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:20,484 INFO L130 PetriNetUnfolder]: 87/168 cut-off events. [2023-08-29 20:51:20,484 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2023-08-29 20:51:20,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 168 events. 87/168 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 559 event pairs, 36 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 355. Up to 155 conditions per place. [2023-08-29 20:51:20,486 INFO L137 encePairwiseOnDemand]: 189/192 looper letters, 14 selfloop transitions, 2 changer transitions 0/17 dead transitions. [2023-08-29 20:51:20,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 17 transitions, 74 flow [2023-08-29 20:51:20,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:51:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:51:20,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 313 transitions. [2023-08-29 20:51:20,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4075520833333333 [2023-08-29 20:51:20,489 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 313 transitions. [2023-08-29 20:51:20,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 313 transitions. [2023-08-29 20:51:20,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:20,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 313 transitions. [2023-08-29 20:51:20,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 78.25) internal successors, (313), 4 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:20,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:20,493 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:20,493 INFO L175 Difference]: Start difference. First operand has 24 places, 15 transitions, 38 flow. Second operand 4 states and 313 transitions. [2023-08-29 20:51:20,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 17 transitions, 74 flow [2023-08-29 20:51:20,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 17 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:51:20,494 INFO L231 Difference]: Finished difference. Result has 23 places, 14 transitions, 36 flow [2023-08-29 20:51:20,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=36, PETRI_PLACES=23, PETRI_TRANSITIONS=14} [2023-08-29 20:51:20,495 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, -5 predicate places. [2023-08-29 20:51:20,498 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 14 transitions, 36 flow [2023-08-29 20:51:20,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.75) internal successors, (303), 4 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:20,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:20,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:20,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:51:20,501 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-29 20:51:20,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:20,501 INFO L85 PathProgramCache]: Analyzing trace with hash 443305138, now seen corresponding path program 1 times [2023-08-29 20:51:20,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:20,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568780619] [2023-08-29 20:51:20,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:20,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:20,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-29 20:51:20,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:20,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568780619] [2023-08-29 20:51:20,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568780619] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:20,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:20,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:51:20,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963388765] [2023-08-29 20:51:20,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:20,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:51:20,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:20,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:51:20,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:51:20,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 192 [2023-08-29 20:51:20,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 14 transitions, 36 flow. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:20,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:20,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 192 [2023-08-29 20:51:20,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:20,833 INFO L130 PetriNetUnfolder]: 132/252 cut-off events. [2023-08-29 20:51:20,834 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 20:51:20,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 252 events. 132/252 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1019 event pairs, 36 based on Foata normal form. 14/266 useless extension candidates. Maximal degree in co-relation 519. Up to 161 conditions per place. [2023-08-29 20:51:20,838 INFO L137 encePairwiseOnDemand]: 187/192 looper letters, 20 selfloop transitions, 4 changer transitions 0/24 dead transitions. [2023-08-29 20:51:20,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 24 transitions, 108 flow [2023-08-29 20:51:20,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:51:20,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:51:20,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2023-08-29 20:51:20,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4600694444444444 [2023-08-29 20:51:20,841 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 265 transitions. [2023-08-29 20:51:20,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 265 transitions. [2023-08-29 20:51:20,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:20,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 265 transitions. [2023-08-29 20:51:20,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:20,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:20,848 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:20,848 INFO L175 Difference]: Start difference. First operand has 23 places, 14 transitions, 36 flow. Second operand 3 states and 265 transitions. [2023-08-29 20:51:20,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 24 transitions, 108 flow [2023-08-29 20:51:20,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 24 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:51:20,849 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 59 flow [2023-08-29 20:51:20,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=33, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=59, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-08-29 20:51:20,851 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, -3 predicate places. [2023-08-29 20:51:20,851 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 59 flow [2023-08-29 20:51:20,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:20,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:20,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:20,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:51:20,852 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-29 20:51:20,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:20,853 INFO L85 PathProgramCache]: Analyzing trace with hash 857556471, now seen corresponding path program 1 times [2023-08-29 20:51:20,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:20,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527651385] [2023-08-29 20:51:20,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:20,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:21,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:21,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:21,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527651385] [2023-08-29 20:51:21,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527651385] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:21,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:21,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:51:21,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394589820] [2023-08-29 20:51:21,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:21,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:51:21,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:21,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:51:21,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:51:21,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 192 [2023-08-29 20:51:21,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 59 flow. Second operand has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:21,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:21,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 192 [2023-08-29 20:51:21,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:21,276 INFO L130 PetriNetUnfolder]: 71/167 cut-off events. [2023-08-29 20:51:21,276 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2023-08-29 20:51:21,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 167 events. 71/167 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 648 event pairs, 13 based on Foata normal form. 25/192 useless extension candidates. Maximal degree in co-relation 419. Up to 83 conditions per place. [2023-08-29 20:51:21,277 INFO L137 encePairwiseOnDemand]: 187/192 looper letters, 20 selfloop transitions, 3 changer transitions 15/40 dead transitions. [2023-08-29 20:51:21,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 40 transitions, 216 flow [2023-08-29 20:51:21,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:51:21,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:51:21,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 436 transitions. [2023-08-29 20:51:21,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45416666666666666 [2023-08-29 20:51:21,280 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 436 transitions. [2023-08-29 20:51:21,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 436 transitions. [2023-08-29 20:51:21,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:21,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 436 transitions. [2023-08-29 20:51:21,281 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-29 20:51:21,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:21,284 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:21,284 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 59 flow. Second operand 5 states and 436 transitions. [2023-08-29 20:51:21,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 40 transitions, 216 flow [2023-08-29 20:51:21,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 40 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:51:21,286 INFO L231 Difference]: Finished difference. Result has 30 places, 18 transitions, 78 flow [2023-08-29 20:51:21,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=23, 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=78, PETRI_PLACES=30, PETRI_TRANSITIONS=18} [2023-08-29 20:51:21,286 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 2 predicate places. [2023-08-29 20:51:21,287 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 18 transitions, 78 flow [2023-08-29 20:51:21,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:21,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:21,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:21,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:51:21,288 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-29 20:51:21,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:21,288 INFO L85 PathProgramCache]: Analyzing trace with hash 371691894, now seen corresponding path program 1 times [2023-08-29 20:51:21,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:21,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042611155] [2023-08-29 20:51:21,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:21,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:21,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:21,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:21,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042611155] [2023-08-29 20:51:21,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042611155] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:21,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:21,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:51:21,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260769209] [2023-08-29 20:51:21,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:21,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:51:21,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:21,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:51:21,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:51:21,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 192 [2023-08-29 20:51:21,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 18 transitions, 78 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-29 20:51:21,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:21,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 192 [2023-08-29 20:51:21,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:21,603 INFO L130 PetriNetUnfolder]: 28/82 cut-off events. [2023-08-29 20:51:21,603 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2023-08-29 20:51:21,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 82 events. 28/82 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 236 event pairs, 8 based on Foata normal form. 12/94 useless extension candidates. Maximal degree in co-relation 257. Up to 33 conditions per place. [2023-08-29 20:51:21,604 INFO L137 encePairwiseOnDemand]: 187/192 looper letters, 15 selfloop transitions, 5 changer transitions 11/33 dead transitions. [2023-08-29 20:51:21,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 195 flow [2023-08-29 20:51:21,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:51:21,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:51:21,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 510 transitions. [2023-08-29 20:51:21,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4427083333333333 [2023-08-29 20:51:21,606 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 510 transitions. [2023-08-29 20:51:21,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 510 transitions. [2023-08-29 20:51:21,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:21,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 510 transitions. [2023-08-29 20:51:21,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 85.0) internal successors, (510), 6 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:21,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:21,610 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:21,610 INFO L175 Difference]: Start difference. First operand has 30 places, 18 transitions, 78 flow. Second operand 6 states and 510 transitions. [2023-08-29 20:51:21,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 195 flow [2023-08-29 20:51:21,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 33 transitions, 182 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-29 20:51:21,612 INFO L231 Difference]: Finished difference. Result has 34 places, 18 transitions, 89 flow [2023-08-29 20:51:21,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=26, 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=89, PETRI_PLACES=34, PETRI_TRANSITIONS=18} [2023-08-29 20:51:21,613 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 6 predicate places. [2023-08-29 20:51:21,613 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 18 transitions, 89 flow [2023-08-29 20:51:21,614 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-29 20:51:21,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:21,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:21,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:51:21,614 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-29 20:51:21,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:21,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1730801220, now seen corresponding path program 1 times [2023-08-29 20:51:21,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:21,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626974171] [2023-08-29 20:51:21,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:21,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:51:21,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:51:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:51:21,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:51:21,683 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:51:21,684 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-08-29 20:51:21,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-08-29 20:51:21,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-29 20:51:21,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-08-29 20:51:21,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-29 20:51:21,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-29 20:51:21,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-29 20:51:21,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-08-29 20:51:21,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-08-29 20:51:21,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-29 20:51:21,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:51:21,687 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:21,692 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:51:21,692 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:51:21,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:51:21 BasicIcfg [2023-08-29 20:51:21,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:51:21,746 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:51:21,746 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:51:21,746 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:51:21,746 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:51:15" (3/4) ... [2023-08-29 20:51:21,748 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:51:21,748 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:51:21,757 INFO L158 Benchmark]: Toolchain (without parser) took 7442.19ms. Allocated memory was 62.9MB in the beginning and 134.2MB in the end (delta: 71.3MB). Free memory was 38.4MB in the beginning and 76.5MB in the end (delta: -38.1MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2023-08-29 20:51:21,757 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 52.4MB. Free memory was 30.1MB in the beginning and 30.0MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:51:21,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.19ms. Allocated memory is still 62.9MB. Free memory was 38.2MB in the beginning and 31.5MB in the end (delta: 6.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-08-29 20:51:21,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.31ms. Allocated memory is still 62.9MB. Free memory was 31.5MB in the beginning and 29.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:51:21,759 INFO L158 Benchmark]: Boogie Preprocessor took 22.17ms. Allocated memory is still 62.9MB. Free memory was 29.3MB in the beginning and 27.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:51:21,759 INFO L158 Benchmark]: RCFGBuilder took 663.55ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 27.6MB in the beginning and 47.1MB in the end (delta: -19.6MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2023-08-29 20:51:21,760 INFO L158 Benchmark]: TraceAbstraction took 6187.13ms. Allocated memory was 75.5MB in the beginning and 134.2MB in the end (delta: 58.7MB). Free memory was 46.2MB in the beginning and 76.5MB in the end (delta: -30.3MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2023-08-29 20:51:21,760 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 134.2MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:51:21,762 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 52.4MB. Free memory was 30.1MB in the beginning and 30.0MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.19ms. Allocated memory is still 62.9MB. Free memory was 38.2MB in the beginning and 31.5MB in the end (delta: 6.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.31ms. Allocated memory is still 62.9MB. Free memory was 31.5MB in the beginning and 29.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.17ms. Allocated memory is still 62.9MB. Free memory was 29.3MB in the beginning and 27.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 663.55ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 27.6MB in the beginning and 47.1MB in the end (delta: -19.6MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6187.13ms. Allocated memory was 75.5MB in the beginning and 134.2MB in the end (delta: 58.7MB). Free memory was 46.2MB in the beginning and 76.5MB in the end (delta: -30.3MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 134.2MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 97 PlacesBefore, 28 PlacesAfterwards, 92 TransitionsBefore, 21 TransitionsAfterwards, 1044 CoEnabledTransitionPairs, 6 FixpointIterations, 45 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 98 TotalNumberOfCompositions, 2318 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1024, independent: 920, independent conditional: 0, independent unconditional: 920, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 576, independent: 551, independent conditional: 0, independent unconditional: 551, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1024, independent: 369, independent conditional: 0, independent unconditional: 369, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 576, unknown conditional: 0, unknown unconditional: 576] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 33, Positive conditional cache size: 0, Positive unconditional cache size: 33, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff1_thd0; [L722] 0 _Bool x$r_buff1_thd1; [L723] 0 _Bool x$r_buff1_thd2; [L724] 0 _Bool x$read_delayed; [L725] 0 int *x$read_delayed_var; [L726] 0 int x$w_buff0; [L727] 0 _Bool x$w_buff0_used; [L728] 0 int x$w_buff1; [L729] 0 _Bool x$w_buff1_used; [L731] 0 int y = 0; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L803] 0 pthread_t t2561; [L804] FCALL, FORK 0 pthread_create(&t2561, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2561, ((void *)0), P0, ((void *)0))=-1, t2561={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] [L805] 0 pthread_t t2562; [L806] FCALL, FORK 0 pthread_create(&t2562, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2562, ((void *)0), P1, ((void *)0))=0, t2561={5:0}, t2562={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] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 1 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L778] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L737] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 x$flush_delayed = weak$$choice2 [L745] 1 x$mem_tmp = x [L746] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L747] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L748] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L749] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L750] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L752] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EAX = x [L754] 1 x = x$flush_delayed ? x$mem_tmp : x [L755] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L781] 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) [L782] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L783] 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 [L784] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L785] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L808] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L810] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L810] RET 0 assume_abort_if_not(main$tmp_guard0) [L812] 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) [L813] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L814] 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 [L815] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L816] 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_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2561={5:0}, t2562={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 801]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 806]: 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: 804]: 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, 111 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: 6.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 134 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 89 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 272 IncrementalHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 5 mSDtfsCounter, 272 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=6, InterpolantAutomatonStates: 23, 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.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 190 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:51:21,794 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/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 48c4b734419752ee9918164f01e542b34e2482d2668432fb42f6f1192b7f0b6a --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:51:23,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:51:23,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:51:23,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:51:23,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:51:23,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:51:23,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:51:23,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:51:23,818 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:51:23,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:51:23,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:51:23,826 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:51:23,826 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:51:23,828 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:51:23,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:51:23,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:51:23,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:51:23,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:51:23,839 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:51:23,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:51:23,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:51:23,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:51:23,860 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:51:23,861 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:51:23,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:51:23,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:51:23,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:51:23,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:51:23,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:51:23,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:51:23,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:51:23,874 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:51:23,875 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:51:23,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:51:23,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:51:23,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:51:23,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:51:23,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:51:23,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:51:23,879 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:51:23,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:51:23,881 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 20:51:23,914 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:51:23,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:51:23,915 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:51:23,916 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:51:23,917 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:51:23,917 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:51:23,917 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:51:23,917 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:51:23,918 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:51:23,918 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:51:23,919 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:51:23,919 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:51:23,919 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:51:23,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:51:23,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:51:23,920 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:51:23,920 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:51:23,920 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:51:23,920 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:51:23,920 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:51:23,921 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:51:23,921 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:51:23,921 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:51:23,921 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:51:23,921 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:51:23,922 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:51:23,922 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:51:23,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:51:23,922 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:51:23,922 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:51:23,923 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:51:23,923 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:51:23,923 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:51:23,923 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:51:23,924 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:51:23,924 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:51:23,924 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:51:23,924 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 -> 48c4b734419752ee9918164f01e542b34e2482d2668432fb42f6f1192b7f0b6a Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:51:24,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:51:24,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:51:24,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:51:24,306 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:51:24,306 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:51:24,307 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-29 20:51:25,452 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:51:25,675 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:51:25,675 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-29 20:51:25,708 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9ec1e5be/f6c1f49d82c2425d85c587e548470539/FLAG914a81419 [2023-08-29 20:51:25,729 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9ec1e5be/f6c1f49d82c2425d85c587e548470539 [2023-08-29 20:51:25,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:51:25,732 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:51:25,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:51:25,735 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:51:25,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:51:25,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:51:25" (1/1) ... [2023-08-29 20:51:25,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a7954b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:25, skipping insertion in model container [2023-08-29 20:51:25,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:51:25" (1/1) ... [2023-08-29 20:51:25,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:51:25,792 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:51:25,999 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/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-08-29 20:51:26,198 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:51:26,218 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:51:26,230 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/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-08-29 20:51:26,275 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:51:26,308 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:51:26,308 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:51:26,315 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:51:26,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:26 WrapperNode [2023-08-29 20:51:26,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:51:26,317 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:51:26,317 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:51:26,317 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:51:26,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:26" (1/1) ... [2023-08-29 20:51:26,340 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:26" (1/1) ... [2023-08-29 20:51:26,369 INFO L138 Inliner]: procedures = 178, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 113 [2023-08-29 20:51:26,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:51:26,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:51:26,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:51:26,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:51:26,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:26" (1/1) ... [2023-08-29 20:51:26,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:26" (1/1) ... [2023-08-29 20:51:26,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:26" (1/1) ... [2023-08-29 20:51:26,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:26" (1/1) ... [2023-08-29 20:51:26,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:26" (1/1) ... [2023-08-29 20:51:26,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:26" (1/1) ... [2023-08-29 20:51:26,402 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:26" (1/1) ... [2023-08-29 20:51:26,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:26" (1/1) ... [2023-08-29 20:51:26,407 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:51:26,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:51:26,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:51:26,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:51:26,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:26" (1/1) ... [2023-08-29 20:51:26,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:51:26,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:51:26,441 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:51:26,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:51:26,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:51:26,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:51:26,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:51:26,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:51:26,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:51:26,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:51:26,485 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:51:26,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:51:26,485 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:51:26,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:51:26,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:51:26,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:51:26,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:51:26,487 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:51:26,653 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:51:26,654 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:51:26,999 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:51:27,120 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:51:27,121 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:51:27,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:51:27 BoogieIcfgContainer [2023-08-29 20:51:27,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:51:27,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:51:27,126 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:51:27,129 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:51:27,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:51:25" (1/3) ... [2023-08-29 20:51:27,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d4ec9af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:51:27, skipping insertion in model container [2023-08-29 20:51:27,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:26" (2/3) ... [2023-08-29 20:51:27,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d4ec9af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:51:27, skipping insertion in model container [2023-08-29 20:51:27,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:51:27" (3/3) ... [2023-08-29 20:51:27,133 INFO L112 eAbstractionObserver]: Analyzing ICFG safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-29 20:51:27,149 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:51:27,149 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-29 20:51:27,149 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:51:27,204 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:51:27,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 95 transitions, 200 flow [2023-08-29 20:51:27,305 INFO L130 PetriNetUnfolder]: 2/93 cut-off events. [2023-08-29 20:51:27,305 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:27,310 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 55 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2023-08-29 20:51:27,310 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 95 transitions, 200 flow [2023-08-29 20:51:27,314 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 93 transitions, 192 flow [2023-08-29 20:51:27,319 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:51:27,331 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 93 transitions, 192 flow [2023-08-29 20:51:27,335 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 93 transitions, 192 flow [2023-08-29 20:51:27,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 93 transitions, 192 flow [2023-08-29 20:51:27,366 INFO L130 PetriNetUnfolder]: 2/93 cut-off events. [2023-08-29 20:51:27,367 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:27,367 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 55 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2023-08-29 20:51:27,369 INFO L119 LiptonReduction]: Number of co-enabled transitions 1044 [2023-08-29 20:51:32,110 INFO L134 LiptonReduction]: Checked pairs total: 2473 [2023-08-29 20:51:32,111 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-08-29 20:51:32,123 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:51:32,128 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;@4f317287, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:51:32,129 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-29 20:51:32,130 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:51:32,130 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:32,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:32,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:51:32,132 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-29 20:51:32,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:32,136 INFO L85 PathProgramCache]: Analyzing trace with hash 428, now seen corresponding path program 1 times [2023-08-29 20:51:32,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:32,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129743360] [2023-08-29 20:51:32,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:32,148 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:32,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:32,157 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:51:32,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-29 20:51:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:32,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:51:32,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:32,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:32,236 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:32,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:32,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129743360] [2023-08-29 20:51:32,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129743360] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:32,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:32,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:51:32,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461012708] [2023-08-29 20:51:32,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:32,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:51:32,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:32,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:51:32,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:51:32,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 192 [2023-08-29 20:51:32,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 48 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-29 20:51:32,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:32,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 192 [2023-08-29 20:51:32,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:32,423 INFO L130 PetriNetUnfolder]: 173/306 cut-off events. [2023-08-29 20:51:32,423 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 20:51:32,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 306 events. 173/306 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1146 event pairs, 173 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 612. Up to 303 conditions per place. [2023-08-29 20:51:32,427 INFO L137 encePairwiseOnDemand]: 188/192 looper letters, 16 selfloop transitions, 0 changer transitions 0/17 dead transitions. [2023-08-29 20:51:32,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 17 transitions, 72 flow [2023-08-29 20:51:32,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:51:32,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:51:32,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 190 transitions. [2023-08-29 20:51:32,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4947916666666667 [2023-08-29 20:51:32,440 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 190 transitions. [2023-08-29 20:51:32,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 190 transitions. [2023-08-29 20:51:32,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:32,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 190 transitions. [2023-08-29 20:51:32,446 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-29 20:51:32,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:32,453 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:32,454 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 48 flow. Second operand 2 states and 190 transitions. [2023-08-29 20:51:32,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 17 transitions, 72 flow [2023-08-29 20:51:32,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 17 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:51:32,458 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 38 flow [2023-08-29 20:51:32,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=38, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2023-08-29 20:51:32,463 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, -5 predicate places. [2023-08-29 20:51:32,463 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 38 flow [2023-08-29 20:51:32,463 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-29 20:51:32,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:32,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:51:32,475 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-29 20:51:32,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:32,673 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-29 20:51:32,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:32,674 INFO L85 PathProgramCache]: Analyzing trace with hash 403689171, now seen corresponding path program 1 times [2023-08-29 20:51:32,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:32,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1886810832] [2023-08-29 20:51:32,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:32,675 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:32,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:32,676 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:51:32,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-29 20:51:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:32,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:51:32,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:32,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:32,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:32,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:32,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1886810832] [2023-08-29 20:51:32,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1886810832] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:32,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:32,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:51:32,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946009806] [2023-08-29 20:51:32,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:32,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:51:32,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:32,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:51:32,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:51:32,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 192 [2023-08-29 20:51:32,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 38 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-29 20:51:32,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:32,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 192 [2023-08-29 20:51:32,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:32,891 INFO L130 PetriNetUnfolder]: 135/264 cut-off events. [2023-08-29 20:51:32,891 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:32,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 264 events. 135/264 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1048 event pairs, 21 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 514. Up to 187 conditions per place. [2023-08-29 20:51:32,904 INFO L137 encePairwiseOnDemand]: 189/192 looper letters, 19 selfloop transitions, 2 changer transitions 2/24 dead transitions. [2023-08-29 20:51:32,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 24 transitions, 98 flow [2023-08-29 20:51:32,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:51:32,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:51:32,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 276 transitions. [2023-08-29 20:51:32,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2023-08-29 20:51:32,912 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 276 transitions. [2023-08-29 20:51:32,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 276 transitions. [2023-08-29 20:51:32,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:32,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 276 transitions. [2023-08-29 20:51:32,916 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-29 20:51:32,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:32,920 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:32,920 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 38 flow. Second operand 3 states and 276 transitions. [2023-08-29 20:51:32,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 24 transitions, 98 flow [2023-08-29 20:51:32,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 24 transitions, 98 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:51:32,921 INFO L231 Difference]: Finished difference. Result has 24 places, 15 transitions, 38 flow [2023-08-29 20:51:32,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=24, PETRI_TRANSITIONS=15} [2023-08-29 20:51:32,922 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, -4 predicate places. [2023-08-29 20:51:32,922 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 15 transitions, 38 flow [2023-08-29 20:51:32,923 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-29 20:51:32,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:32,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:32,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-29 20:51:33,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:33,132 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-29 20:51:33,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:33,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1398293257, now seen corresponding path program 1 times [2023-08-29 20:51:33,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:33,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447226187] [2023-08-29 20:51:33,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:33,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:33,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:33,135 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:51:33,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-29 20:51:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:33,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:51:33,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:33,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:33,234 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:33,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:33,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447226187] [2023-08-29 20:51:33,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [447226187] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:33,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:33,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:51:33,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762184982] [2023-08-29 20:51:33,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:33,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:51:33,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:33,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:51:33,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:51:33,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 192 [2023-08-29 20:51:33,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 15 transitions, 38 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-29 20:51:33,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:33,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 192 [2023-08-29 20:51:33,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:33,350 INFO L130 PetriNetUnfolder]: 56/128 cut-off events. [2023-08-29 20:51:33,350 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-08-29 20:51:33,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 128 events. 56/128 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 415 event pairs, 12 based on Foata normal form. 16/137 useless extension candidates. Maximal degree in co-relation 276. Up to 69 conditions per place. [2023-08-29 20:51:33,351 INFO L137 encePairwiseOnDemand]: 187/192 looper letters, 19 selfloop transitions, 3 changer transitions 13/36 dead transitions. [2023-08-29 20:51:33,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 36 transitions, 158 flow [2023-08-29 20:51:33,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:51:33,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:51:33,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2023-08-29 20:51:33,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46041666666666664 [2023-08-29 20:51:33,353 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 442 transitions. [2023-08-29 20:51:33,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 442 transitions. [2023-08-29 20:51:33,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:33,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 442 transitions. [2023-08-29 20:51:33,355 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-29 20:51:33,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:33,357 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:33,358 INFO L175 Difference]: Start difference. First operand has 24 places, 15 transitions, 38 flow. Second operand 5 states and 442 transitions. [2023-08-29 20:51:33,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 36 transitions, 158 flow [2023-08-29 20:51:33,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 36 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:51:33,359 INFO L231 Difference]: Finished difference. Result has 28 places, 17 transitions, 61 flow [2023-08-29 20:51:33,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=21, 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=5, PETRI_FLOW=61, PETRI_PLACES=28, PETRI_TRANSITIONS=17} [2023-08-29 20:51:33,360 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 0 predicate places. [2023-08-29 20:51:33,360 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 17 transitions, 61 flow [2023-08-29 20:51:33,360 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-29 20:51:33,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:33,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:33,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-29 20:51:33,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:33,570 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:51:33,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:33,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1274398807, now seen corresponding path program 1 times [2023-08-29 20:51:33,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:33,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044159413] [2023-08-29 20:51:33,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:33,572 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:33,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:33,575 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:51:33,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-29 20:51:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:33,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:51:33,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:33,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:33,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:33,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:33,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044159413] [2023-08-29 20:51:33,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1044159413] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:33,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:33,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:51:33,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402918640] [2023-08-29 20:51:33,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:33,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:51:33,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:33,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:51:33,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:51:33,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 192 [2023-08-29 20:51:33,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 17 transitions, 61 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-29 20:51:33,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:33,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 192 [2023-08-29 20:51:33,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:33,842 INFO L130 PetriNetUnfolder]: 20/59 cut-off events. [2023-08-29 20:51:33,843 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-29 20:51:33,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 59 events. 20/59 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 125 event pairs, 8 based on Foata normal form. 7/65 useless extension candidates. Maximal degree in co-relation 159. Up to 24 conditions per place. [2023-08-29 20:51:33,843 INFO L137 encePairwiseOnDemand]: 187/192 looper letters, 17 selfloop transitions, 5 changer transitions 7/30 dead transitions. [2023-08-29 20:51:33,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 30 transitions, 157 flow [2023-08-29 20:51:33,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:51:33,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:51:33,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 517 transitions. [2023-08-29 20:51:33,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4487847222222222 [2023-08-29 20:51:33,846 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 517 transitions. [2023-08-29 20:51:33,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 517 transitions. [2023-08-29 20:51:33,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:33,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 517 transitions. [2023-08-29 20:51:33,859 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-29 20:51:33,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:33,861 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:33,861 INFO L175 Difference]: Start difference. First operand has 28 places, 17 transitions, 61 flow. Second operand 6 states and 517 transitions. [2023-08-29 20:51:33,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 30 transitions, 157 flow [2023-08-29 20:51:33,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 30 transitions, 144 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-29 20:51:33,863 INFO L231 Difference]: Finished difference. Result has 32 places, 17 transitions, 72 flow [2023-08-29 20:51:33,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=72, PETRI_PLACES=32, PETRI_TRANSITIONS=17} [2023-08-29 20:51:33,864 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 4 predicate places. [2023-08-29 20:51:33,864 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 17 transitions, 72 flow [2023-08-29 20:51:33,864 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-29 20:51:33,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:33,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:33,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-29 20:51:34,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:34,080 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-29 20:51:34,080 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:34,080 INFO L85 PathProgramCache]: Analyzing trace with hash -947622487, now seen corresponding path program 1 times [2023-08-29 20:51:34,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:34,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747279780] [2023-08-29 20:51:34,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:34,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:34,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:34,082 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:51:34,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-29 20:51:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:34,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:51:34,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:34,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:34,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:34,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:34,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747279780] [2023-08-29 20:51:34,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747279780] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:34,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:34,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:51:34,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221006667] [2023-08-29 20:51:34,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:34,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:51:34,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:34,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:51:34,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:51:34,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 192 [2023-08-29 20:51:34,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 17 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:34,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:34,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 192 [2023-08-29 20:51:34,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:34,263 INFO L130 PetriNetUnfolder]: 21/66 cut-off events. [2023-08-29 20:51:34,263 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2023-08-29 20:51:34,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 66 events. 21/66 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 156 event pairs, 9 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 192. Up to 46 conditions per place. [2023-08-29 20:51:34,264 INFO L137 encePairwiseOnDemand]: 189/192 looper letters, 25 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2023-08-29 20:51:34,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 27 transitions, 176 flow [2023-08-29 20:51:34,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:51:34,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:51:34,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2023-08-29 20:51:34,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2023-08-29 20:51:34,266 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 270 transitions. [2023-08-29 20:51:34,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 270 transitions. [2023-08-29 20:51:34,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:34,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 270 transitions. [2023-08-29 20:51:34,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:34,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:34,268 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:34,268 INFO L175 Difference]: Start difference. First operand has 32 places, 17 transitions, 72 flow. Second operand 3 states and 270 transitions. [2023-08-29 20:51:34,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 27 transitions, 176 flow [2023-08-29 20:51:34,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 146 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-29 20:51:34,270 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 68 flow [2023-08-29 20:51:34,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2023-08-29 20:51:34,271 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 0 predicate places. [2023-08-29 20:51:34,271 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 68 flow [2023-08-29 20:51:34,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:34,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:34,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:34,285 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-29 20:51:34,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:34,473 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:51:34,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:34,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1084391061, now seen corresponding path program 1 times [2023-08-29 20:51:34,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:34,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1048965575] [2023-08-29 20:51:34,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:34,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:34,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:34,475 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:51:34,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-29 20:51:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:34,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-29 20:51:34,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:34,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:34,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:34,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:34,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1048965575] [2023-08-29 20:51:34,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1048965575] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:34,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:34,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:51:34,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930372932] [2023-08-29 20:51:34,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:34,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:51:34,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:34,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:51:34,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:51:34,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 192 [2023-08-29 20:51:34,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 68 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-29 20:51:34,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:34,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 192 [2023-08-29 20:51:34,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:34,997 INFO L130 PetriNetUnfolder]: 19/62 cut-off events. [2023-08-29 20:51:34,997 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2023-08-29 20:51:34,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 62 events. 19/62 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 148 event pairs, 5 based on Foata normal form. 2/64 useless extension candidates. Maximal degree in co-relation 178. Up to 53 conditions per place. [2023-08-29 20:51:34,997 INFO L137 encePairwiseOnDemand]: 189/192 looper letters, 13 selfloop transitions, 2 changer transitions 4/20 dead transitions. [2023-08-29 20:51:34,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 20 transitions, 116 flow [2023-08-29 20:51:34,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:51:34,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:51:34,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 309 transitions. [2023-08-29 20:51:34,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40234375 [2023-08-29 20:51:34,999 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 309 transitions. [2023-08-29 20:51:34,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 309 transitions. [2023-08-29 20:51:35,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:35,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 309 transitions. [2023-08-29 20:51:35,001 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-29 20:51:35,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:35,002 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:35,002 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 68 flow. Second operand 4 states and 309 transitions. [2023-08-29 20:51:35,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 20 transitions, 116 flow [2023-08-29 20:51:35,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 20 transitions, 114 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:51:35,004 INFO L231 Difference]: Finished difference. Result has 29 places, 16 transitions, 64 flow [2023-08-29 20:51:35,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=26, 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=4, PETRI_FLOW=64, PETRI_PLACES=29, PETRI_TRANSITIONS=16} [2023-08-29 20:51:35,004 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 1 predicate places. [2023-08-29 20:51:35,004 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 16 transitions, 64 flow [2023-08-29 20:51:35,005 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-29 20:51:35,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:35,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:35,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-29 20:51:35,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:35,206 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-29 20:51:35,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:35,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1055328727, now seen corresponding path program 2 times [2023-08-29 20:51:35,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:35,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564408959] [2023-08-29 20:51:35,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:51:35,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:35,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:35,208 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:51:35,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-29 20:51:35,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:51:35,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:51:35,298 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:51:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:51:35,384 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:51:35,384 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:51:35,385 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-08-29 20:51:35,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-08-29 20:51:35,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-29 20:51:35,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-08-29 20:51:35,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-29 20:51:35,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-29 20:51:35,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-29 20:51:35,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-08-29 20:51:35,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-08-29 20:51:35,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-29 20:51:35,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-29 20:51:35,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:35,589 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-08-29 20:51:35,594 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:51:35,595 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:51:35,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:51:35 BasicIcfg [2023-08-29 20:51:35,649 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:51:35,650 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:51:35,650 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:51:35,650 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:51:35,650 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:51:27" (3/4) ... [2023-08-29 20:51:35,653 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:51:35,653 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:51:35,653 INFO L158 Benchmark]: Toolchain (without parser) took 9921.12ms. Allocated memory was 67.1MB in the beginning and 113.2MB in the end (delta: 46.1MB). Free memory was 35.8MB in the beginning and 55.4MB in the end (delta: -19.7MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2023-08-29 20:51:35,654 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 67.1MB. Free memory was 45.7MB in the beginning and 45.6MB in the end (delta: 98.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:51:35,657 INFO L158 Benchmark]: CACSL2BoogieTranslator took 581.43ms. Allocated memory was 67.1MB in the beginning and 92.3MB in the end (delta: 25.2MB). Free memory was 35.5MB in the beginning and 59.1MB in the end (delta: -23.6MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2023-08-29 20:51:35,658 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.99ms. Allocated memory is still 92.3MB. Free memory was 59.1MB in the beginning and 56.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 20:51:35,659 INFO L158 Benchmark]: Boogie Preprocessor took 36.86ms. Allocated memory is still 92.3MB. Free memory was 56.5MB in the beginning and 54.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:51:35,659 INFO L158 Benchmark]: RCFGBuilder took 713.97ms. Allocated memory is still 92.3MB. Free memory was 54.4MB in the beginning and 50.6MB in the end (delta: 3.9MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2023-08-29 20:51:35,660 INFO L158 Benchmark]: TraceAbstraction took 8523.41ms. Allocated memory was 92.3MB in the beginning and 113.2MB in the end (delta: 21.0MB). Free memory was 50.0MB in the beginning and 55.4MB in the end (delta: -5.5MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2023-08-29 20:51:35,660 INFO L158 Benchmark]: Witness Printer took 3.25ms. Allocated memory is still 113.2MB. Free memory is still 55.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:51:35,662 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.22ms. Allocated memory is still 67.1MB. Free memory was 45.7MB in the beginning and 45.6MB in the end (delta: 98.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 581.43ms. Allocated memory was 67.1MB in the beginning and 92.3MB in the end (delta: 25.2MB). Free memory was 35.5MB in the beginning and 59.1MB in the end (delta: -23.6MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.99ms. Allocated memory is still 92.3MB. Free memory was 59.1MB in the beginning and 56.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.86ms. Allocated memory is still 92.3MB. Free memory was 56.5MB in the beginning and 54.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 713.97ms. Allocated memory is still 92.3MB. Free memory was 54.4MB in the beginning and 50.6MB in the end (delta: 3.9MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8523.41ms. Allocated memory was 92.3MB in the beginning and 113.2MB in the end (delta: 21.0MB). Free memory was 50.0MB in the beginning and 55.4MB in the end (delta: -5.5MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * Witness Printer took 3.25ms. Allocated memory is still 113.2MB. Free memory is still 55.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 98 PlacesBefore, 28 PlacesAfterwards, 93 TransitionsBefore, 21 TransitionsAfterwards, 1044 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 97 TotalNumberOfCompositions, 2473 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1146, independent: 1026, independent conditional: 0, independent unconditional: 1026, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 578, independent: 553, independent conditional: 0, independent unconditional: 553, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1146, independent: 473, independent conditional: 0, independent unconditional: 473, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 578, unknown conditional: 0, unknown unconditional: 578] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff1_thd0; [L722] 0 _Bool x$r_buff1_thd1; [L723] 0 _Bool x$r_buff1_thd2; [L724] 0 _Bool x$read_delayed; [L725] 0 int *x$read_delayed_var; [L726] 0 int x$w_buff0; [L727] 0 _Bool x$w_buff0_used; [L728] 0 int x$w_buff1; [L729] 0 _Bool x$w_buff1_used; [L731] 0 int y = 0; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L803] 0 pthread_t t2561; [L804] FCALL, FORK 0 pthread_create(&t2561, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2561, ((void *)0), P0, ((void *)0))=-1, t2561={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] [L805] 0 pthread_t t2562; [L806] FCALL, FORK 0 pthread_create(&t2562, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2562, ((void *)0), P1, ((void *)0))=0, t2561={3:0}, t2562={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] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 1 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L778] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L737] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 x$flush_delayed = weak$$choice2 [L745] 1 x$mem_tmp = x [L746] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L747] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L748] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L749] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L750] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L752] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EAX = x [L754] 1 x = x$flush_delayed ? x$mem_tmp : x [L755] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L781] 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) [L782] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L783] 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 [L784] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L785] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L808] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L810] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L810] RET 0 assume_abort_if_not(main$tmp_guard0) [L812] 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) [L813] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L814] 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 [L815] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L816] 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_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2561={3:0}, t2562={7: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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_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=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 801]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 806]: 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: 804]: 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, 112 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: 8.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 311 IncrementalHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 12 mSDtfsCounter, 311 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=4, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 65 NumberOfCodeBlocks, 65 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 45 ConstructedInterpolants, 10 QuantifiedInterpolants, 354 SizeOfPredicates, 4 NumberOfNonLiveVariables, 521 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:51:35,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample