./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 596bf38d5c1bddbb7fa933c2910678824d7396d44da5246db401a53a5b4ba843 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:26:20,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:26:20,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:26:20,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:26:20,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:26:20,982 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:26:20,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:26:20,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:26:20,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:26:20,992 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:26:20,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:26:20,996 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:26:20,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:26:20,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:26:20,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:26:21,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:26:21,004 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:26:21,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:26:21,007 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:26:21,011 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:26:21,012 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:26:21,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:26:21,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:26:21,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:26:21,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:26:21,026 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:26:21,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:26:21,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:26:21,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:26:21,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:26:21,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:26:21,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:26:21,037 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:26:21,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:26:21,038 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:26:21,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:26:21,039 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:26:21,039 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:26:21,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:26:21,040 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:26:21,041 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:26:21,042 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:26:21,074 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:26:21,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:26:21,075 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:26:21,076 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:26:21,076 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:26:21,077 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:26:21,077 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:26:21,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:26:21,077 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:26:21,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:26:21,078 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:26:21,079 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:26:21,079 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:26:21,079 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:26:21,079 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:26:21,079 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:26:21,080 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:26:21,080 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:26:21,080 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:26:21,080 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:26:21,080 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:26:21,080 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:26:21,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:26:21,081 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:26:21,081 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:26:21,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:26:21,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:26:21,082 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:26:21,082 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:26:21,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:26:21,082 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:26:21,082 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:26:21,083 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:26:21,083 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:26:21,083 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 -> 596bf38d5c1bddbb7fa933c2910678824d7396d44da5246db401a53a5b4ba843 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:26:21,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:26:21,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:26:21,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:26:21,410 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:26:21,410 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:26:21,411 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2023-08-31 23:26:22,495 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:26:22,755 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:26:22,770 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2023-08-31 23:26:22,785 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a82171088/c01c56e61de342d6934000f5588baef5/FLAG75a30b3bd [2023-08-31 23:26:22,796 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a82171088/c01c56e61de342d6934000f5588baef5 [2023-08-31 23:26:22,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:26:22,799 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:26:22,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:26:22,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:26:22,802 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:26:22,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:26:22" (1/1) ... [2023-08-31 23:26:22,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c8f9287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:22, skipping insertion in model container [2023-08-31 23:26:22,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:26:22" (1/1) ... [2023-08-31 23:26:22,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:26:22,865 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:26:23,016 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/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i[974,987] [2023-08-31 23:26:23,263 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:26:23,300 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:26:23,321 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i[974,987] [2023-08-31 23:26:23,372 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:26:23,406 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:26:23,406 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:26:23,412 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:26:23,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:23 WrapperNode [2023-08-31 23:26:23,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:26:23,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:26:23,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:26:23,414 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:26:23,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:23" (1/1) ... [2023-08-31 23:26:23,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:23" (1/1) ... [2023-08-31 23:26:23,465 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2023-08-31 23:26:23,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:26:23,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:26:23,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:26:23,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:26:23,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:23" (1/1) ... [2023-08-31 23:26:23,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:23" (1/1) ... [2023-08-31 23:26:23,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:23" (1/1) ... [2023-08-31 23:26:23,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:23" (1/1) ... [2023-08-31 23:26:23,500 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:23" (1/1) ... [2023-08-31 23:26:23,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:23" (1/1) ... [2023-08-31 23:26:23,516 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:23" (1/1) ... [2023-08-31 23:26:23,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:23" (1/1) ... [2023-08-31 23:26:23,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:26:23,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:26:23,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:26:23,530 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:26:23,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:23" (1/1) ... [2023-08-31 23:26:23,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:26:23,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:26:23,559 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:26:23,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:26:23,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:26:23,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:26:23,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:26:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:26:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:26:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:26:23,607 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:26:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:26:23,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:26:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:26:23,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:26:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:26:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:26:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:26:23,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:26:23,610 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:26:23,764 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:26:23,765 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:26:24,072 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:26:24,352 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:26:24,352 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:26:24,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:26:24 BoogieIcfgContainer [2023-08-31 23:26:24,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:26:24,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:26:24,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:26:24,360 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:26:24,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:26:22" (1/3) ... [2023-08-31 23:26:24,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52da2dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:26:24, skipping insertion in model container [2023-08-31 23:26:24,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:23" (2/3) ... [2023-08-31 23:26:24,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52da2dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:26:24, skipping insertion in model container [2023-08-31 23:26:24,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:26:24" (3/3) ... [2023-08-31 23:26:24,363 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2023-08-31 23:26:24,377 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:26:24,377 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-31 23:26:24,378 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:26:24,444 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:26:24,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 251 flow [2023-08-31 23:26:24,546 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2023-08-31 23:26:24,547 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:26:24,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-31 23:26:24,551 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 118 transitions, 251 flow [2023-08-31 23:26:24,560 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 115 transitions, 239 flow [2023-08-31 23:26:24,564 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:26:24,586 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 115 transitions, 239 flow [2023-08-31 23:26:24,589 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 115 transitions, 239 flow [2023-08-31 23:26:24,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 239 flow [2023-08-31 23:26:24,636 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2023-08-31 23:26:24,636 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:26:24,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-31 23:26:24,639 INFO L119 LiptonReduction]: Number of co-enabled transitions 2140 [2023-08-31 23:26:30,009 INFO L134 LiptonReduction]: Checked pairs total: 6133 [2023-08-31 23:26:30,009 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-08-31 23:26:30,020 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:26:30,024 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;@4912448e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:26:30,024 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-31 23:26:30,026 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:26:30,026 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:26:30,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:30,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:26:30,027 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:26:30,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:30,031 INFO L85 PathProgramCache]: Analyzing trace with hash 554, now seen corresponding path program 1 times [2023-08-31 23:26:30,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:26:30,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275698975] [2023-08-31 23:26:30,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:30,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:26:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:30,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:30,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:26:30,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275698975] [2023-08-31 23:26:30,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275698975] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:30,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:30,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:26:30,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435497348] [2023-08-31 23:26:30,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:30,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:26:30,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:26:30,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:26:30,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:26:30,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 233 [2023-08-31 23:26:30,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 69 flow. Second operand has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:30,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:30,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 233 [2023-08-31 23:26:30,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:30,579 INFO L130 PetriNetUnfolder]: 1331/1972 cut-off events. [2023-08-31 23:26:30,579 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-08-31 23:26:30,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3999 conditions, 1972 events. 1331/1972 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8961 event pairs, 1331 based on Foata normal form. 0/1670 useless extension candidates. Maximal degree in co-relation 3988. Up to 1965 conditions per place. [2023-08-31 23:26:30,591 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 22 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2023-08-31 23:26:30,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 101 flow [2023-08-31 23:26:30,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:26:30,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:26:30,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 236 transitions. [2023-08-31 23:26:30,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5064377682403434 [2023-08-31 23:26:30,606 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 236 transitions. [2023-08-31 23:26:30,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 236 transitions. [2023-08-31 23:26:30,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:30,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 236 transitions. [2023-08-31 23:26:30,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 118.0) internal successors, (236), 2 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:30,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:30,619 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:30,620 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 69 flow. Second operand 2 states and 236 transitions. [2023-08-31 23:26:30,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 101 flow [2023-08-31 23:26:30,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 98 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:26:30,625 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow [2023-08-31 23:26:30,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-08-31 23:26:30,630 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2023-08-31 23:26:30,630 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow [2023-08-31 23:26:30,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:30,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:30,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 23:26:30,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:26:30,633 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:26:30,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:30,643 INFO L85 PathProgramCache]: Analyzing trace with hash 523232435, now seen corresponding path program 1 times [2023-08-31 23:26:30,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:26:30,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127334118] [2023-08-31 23:26:30,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:30,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:26:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:30,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:30,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:26:30,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127334118] [2023-08-31 23:26:30,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127334118] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:30,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:30,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:26:30,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456804728] [2023-08-31 23:26:30,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:30,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:26:30,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:26:30,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:26:30,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:26:30,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 233 [2023-08-31 23:26:30,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:30,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:30,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 233 [2023-08-31 23:26:30,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:31,289 INFO L130 PetriNetUnfolder]: 1093/1728 cut-off events. [2023-08-31 23:26:31,289 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:26:31,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3403 conditions, 1728 events. 1093/1728 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8894 event pairs, 141 based on Foata normal form. 0/1567 useless extension candidates. Maximal degree in co-relation 3400. Up to 1369 conditions per place. [2023-08-31 23:26:31,296 INFO L137 encePairwiseOnDemand]: 230/233 looper letters, 30 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-08-31 23:26:31,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 36 transitions, 148 flow [2023-08-31 23:26:31,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:26:31,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:26:31,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2023-08-31 23:26:31,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49213161659513593 [2023-08-31 23:26:31,300 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 344 transitions. [2023-08-31 23:26:31,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 344 transitions. [2023-08-31 23:26:31,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:31,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 344 transitions. [2023-08-31 23:26:31,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:31,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:31,304 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:31,304 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 344 transitions. [2023-08-31 23:26:31,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 36 transitions, 148 flow [2023-08-31 23:26:31,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 148 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:26:31,305 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-08-31 23:26:31,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-08-31 23:26:31,306 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2023-08-31 23:26:31,306 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-08-31 23:26:31,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:31,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:31,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:31,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:26:31,307 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:26:31,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:31,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1982024488, now seen corresponding path program 1 times [2023-08-31 23:26:31,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:26:31,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401414925] [2023-08-31 23:26:31,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:31,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:26:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:31,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:31,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:26:31,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401414925] [2023-08-31 23:26:31,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401414925] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:31,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:31,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:26:31,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337026301] [2023-08-31 23:26:31,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:31,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:26:31,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:26:31,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:26:31,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:26:31,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 233 [2023-08-31 23:26:31,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:31,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:31,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 233 [2023-08-31 23:26:31,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:31,890 INFO L130 PetriNetUnfolder]: 829/1320 cut-off events. [2023-08-31 23:26:31,891 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2023-08-31 23:26:31,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2693 conditions, 1320 events. 829/1320 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6254 event pairs, 283 based on Foata normal form. 0/1271 useless extension candidates. Maximal degree in co-relation 2689. Up to 843 conditions per place. [2023-08-31 23:26:31,897 INFO L137 encePairwiseOnDemand]: 230/233 looper letters, 29 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2023-08-31 23:26:31,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 140 flow [2023-08-31 23:26:31,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:26:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:26:31,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2023-08-31 23:26:31,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48783977110157367 [2023-08-31 23:26:31,900 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2023-08-31 23:26:31,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2023-08-31 23:26:31,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:31,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2023-08-31 23:26:31,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:31,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:31,904 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:31,905 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 3 states and 341 transitions. [2023-08-31 23:26:31,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 140 flow [2023-08-31 23:26:31,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:26:31,906 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 58 flow [2023-08-31 23:26:31,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-08-31 23:26:31,908 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2023-08-31 23:26:31,910 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 58 flow [2023-08-31 23:26:31,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:31,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:31,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:31,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:26:31,912 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:26:31,912 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:31,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1982024475, now seen corresponding path program 1 times [2023-08-31 23:26:31,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:26:31,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503045434] [2023-08-31 23:26:31,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:31,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:26:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:32,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:32,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:26:32,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503045434] [2023-08-31 23:26:32,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503045434] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:32,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:32,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:26:32,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854037528] [2023-08-31 23:26:32,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:32,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:26:32,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:26:32,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:26:32,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:26:32,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 233 [2023-08-31 23:26:32,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:32,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:32,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 233 [2023-08-31 23:26:32,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:32,757 INFO L130 PetriNetUnfolder]: 749/1140 cut-off events. [2023-08-31 23:26:32,757 INFO L131 PetriNetUnfolder]: For 99/99 co-relation queries the response was YES. [2023-08-31 23:26:32,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2502 conditions, 1140 events. 749/1140 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4756 event pairs, 540 based on Foata normal form. 32/1172 useless extension candidates. Maximal degree in co-relation 2497. Up to 980 conditions per place. [2023-08-31 23:26:32,764 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 33 selfloop transitions, 6 changer transitions 0/41 dead transitions. [2023-08-31 23:26:32,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 184 flow [2023-08-31 23:26:32,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:26:32,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:26:32,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 491 transitions. [2023-08-31 23:26:32,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42145922746781117 [2023-08-31 23:26:32,767 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 491 transitions. [2023-08-31 23:26:32,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 491 transitions. [2023-08-31 23:26:32,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:32,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 491 transitions. [2023-08-31 23:26:32,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:32,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:32,775 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:32,775 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 58 flow. Second operand 5 states and 491 transitions. [2023-08-31 23:26:32,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 184 flow [2023-08-31 23:26:32,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:26:32,777 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 90 flow [2023-08-31 23:26:32,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-08-31 23:26:32,779 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-08-31 23:26:32,779 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 90 flow [2023-08-31 23:26:32,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:32,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:32,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:32,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:26:32,781 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:26:32,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:32,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1579204905, now seen corresponding path program 1 times [2023-08-31 23:26:32,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:26:32,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914653074] [2023-08-31 23:26:32,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:32,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:26:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:33,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:33,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:26:33,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914653074] [2023-08-31 23:26:33,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914653074] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:33,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:33,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:26:33,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601000119] [2023-08-31 23:26:33,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:33,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:26:33,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:26:33,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:26:33,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:26:33,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 233 [2023-08-31 23:26:33,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 90 flow. Second operand has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:33,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:33,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 233 [2023-08-31 23:26:33,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:33,699 INFO L130 PetriNetUnfolder]: 1134/1741 cut-off events. [2023-08-31 23:26:33,700 INFO L131 PetriNetUnfolder]: For 309/309 co-relation queries the response was YES. [2023-08-31 23:26:33,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3999 conditions, 1741 events. 1134/1741 cut-off events. For 309/309 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8552 event pairs, 286 based on Foata normal form. 96/1837 useless extension candidates. Maximal degree in co-relation 3991. Up to 1088 conditions per place. [2023-08-31 23:26:33,707 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 26 selfloop transitions, 5 changer transitions 21/54 dead transitions. [2023-08-31 23:26:33,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 259 flow [2023-08-31 23:26:33,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:26:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:26:33,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 568 transitions. [2023-08-31 23:26:33,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4062947067238913 [2023-08-31 23:26:33,711 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 568 transitions. [2023-08-31 23:26:33,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 568 transitions. [2023-08-31 23:26:33,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:33,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 568 transitions. [2023-08-31 23:26:33,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.66666666666667) internal successors, (568), 6 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:33,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:33,716 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:33,716 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 90 flow. Second operand 6 states and 568 transitions. [2023-08-31 23:26:33,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 259 flow [2023-08-31 23:26:33,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 255 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:26:33,719 INFO L231 Difference]: Finished difference. Result has 43 places, 25 transitions, 96 flow [2023-08-31 23:26:33,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=96, PETRI_PLACES=43, PETRI_TRANSITIONS=25} [2023-08-31 23:26:33,720 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2023-08-31 23:26:33,720 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 25 transitions, 96 flow [2023-08-31 23:26:33,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:33,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:33,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:33,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:26:33,721 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:26:33,722 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:33,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1692170919, now seen corresponding path program 2 times [2023-08-31 23:26:33,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:26:33,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589029835] [2023-08-31 23:26:33,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:33,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:26:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:34,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:34,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:26:34,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589029835] [2023-08-31 23:26:34,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589029835] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:34,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:34,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:26:34,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987270859] [2023-08-31 23:26:34,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:34,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:26:34,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:26:34,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:26:34,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:26:34,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 233 [2023-08-31 23:26:34,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 25 transitions, 96 flow. Second operand has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:34,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:34,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 233 [2023-08-31 23:26:34,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:34,477 INFO L130 PetriNetUnfolder]: 1104/1753 cut-off events. [2023-08-31 23:26:34,477 INFO L131 PetriNetUnfolder]: For 742/742 co-relation queries the response was YES. [2023-08-31 23:26:34,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3983 conditions, 1753 events. 1104/1753 cut-off events. For 742/742 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9050 event pairs, 194 based on Foata normal form. 96/1848 useless extension candidates. Maximal degree in co-relation 3974. Up to 926 conditions per place. [2023-08-31 23:26:34,485 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 30 selfloop transitions, 4 changer transitions 9/45 dead transitions. [2023-08-31 23:26:34,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 226 flow [2023-08-31 23:26:34,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:26:34,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:26:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2023-08-31 23:26:34,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41030042918454934 [2023-08-31 23:26:34,488 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 478 transitions. [2023-08-31 23:26:34,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 478 transitions. [2023-08-31 23:26:34,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:34,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 478 transitions. [2023-08-31 23:26:34,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:34,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:34,492 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:34,493 INFO L175 Difference]: Start difference. First operand has 43 places, 25 transitions, 96 flow. Second operand 5 states and 478 transitions. [2023-08-31 23:26:34,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 226 flow [2023-08-31 23:26:34,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 212 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-31 23:26:34,497 INFO L231 Difference]: Finished difference. Result has 42 places, 22 transitions, 84 flow [2023-08-31 23:26:34,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=42, PETRI_TRANSITIONS=22} [2023-08-31 23:26:34,498 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2023-08-31 23:26:34,498 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 22 transitions, 84 flow [2023-08-31 23:26:34,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:34,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:34,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:34,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:26:34,499 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:26:34,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:34,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1313218231, now seen corresponding path program 3 times [2023-08-31 23:26:34,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:26:34,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562527259] [2023-08-31 23:26:34,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:34,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:26:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:34,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:34,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:26:34,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562527259] [2023-08-31 23:26:34,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562527259] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:34,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:34,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:26:34,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237357397] [2023-08-31 23:26:34,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:34,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:26:34,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:26:34,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:26:34,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:26:34,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 233 [2023-08-31 23:26:34,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 22 transitions, 84 flow. Second operand has 6 states, 6 states have (on average 86.66666666666667) internal successors, (520), 6 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:34,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:34,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 233 [2023-08-31 23:26:34,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:35,316 INFO L130 PetriNetUnfolder]: 901/1412 cut-off events. [2023-08-31 23:26:35,317 INFO L131 PetriNetUnfolder]: For 862/862 co-relation queries the response was YES. [2023-08-31 23:26:35,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3316 conditions, 1412 events. 901/1412 cut-off events. For 862/862 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6892 event pairs, 186 based on Foata normal form. 96/1508 useless extension candidates. Maximal degree in co-relation 3307. Up to 757 conditions per place. [2023-08-31 23:26:35,323 INFO L137 encePairwiseOnDemand]: 226/233 looper letters, 26 selfloop transitions, 4 changer transitions 21/53 dead transitions. [2023-08-31 23:26:35,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 259 flow [2023-08-31 23:26:35,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:26:35,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:26:35,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 650 transitions. [2023-08-31 23:26:35,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39852851011649293 [2023-08-31 23:26:35,326 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 650 transitions. [2023-08-31 23:26:35,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 650 transitions. [2023-08-31 23:26:35,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:35,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 650 transitions. [2023-08-31 23:26:35,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:35,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:35,330 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:35,330 INFO L175 Difference]: Start difference. First operand has 42 places, 22 transitions, 84 flow. Second operand 7 states and 650 transitions. [2023-08-31 23:26:35,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 259 flow [2023-08-31 23:26:35,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 53 transitions, 231 flow, removed 2 selfloop flow, removed 10 redundant places. [2023-08-31 23:26:35,333 INFO L231 Difference]: Finished difference. Result has 41 places, 22 transitions, 80 flow [2023-08-31 23:26:35,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=80, PETRI_PLACES=41, PETRI_TRANSITIONS=22} [2023-08-31 23:26:35,334 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-08-31 23:26:35,334 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 22 transitions, 80 flow [2023-08-31 23:26:35,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.66666666666667) internal successors, (520), 6 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:35,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:35,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:35,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:26:35,335 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:26:35,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:35,336 INFO L85 PathProgramCache]: Analyzing trace with hash -2055064991, now seen corresponding path program 1 times [2023-08-31 23:26:35,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:26:35,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872578390] [2023-08-31 23:26:35,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:35,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:26:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:35,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:26:35,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872578390] [2023-08-31 23:26:35,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872578390] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:35,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:35,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:26:35,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591727085] [2023-08-31 23:26:35,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:35,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:26:35,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:26:35,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:26:35,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:26:35,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 233 [2023-08-31 23:26:35,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 22 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:35,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:35,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 233 [2023-08-31 23:26:35,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:35,858 INFO L130 PetriNetUnfolder]: 424/675 cut-off events. [2023-08-31 23:26:35,859 INFO L131 PetriNetUnfolder]: For 585/585 co-relation queries the response was YES. [2023-08-31 23:26:35,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1637 conditions, 675 events. 424/675 cut-off events. For 585/585 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2735 event pairs, 246 based on Foata normal form. 45/705 useless extension candidates. Maximal degree in co-relation 1628. Up to 651 conditions per place. [2023-08-31 23:26:35,863 INFO L137 encePairwiseOnDemand]: 229/233 looper letters, 20 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2023-08-31 23:26:35,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 25 transitions, 127 flow [2023-08-31 23:26:35,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:26:35,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:26:35,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 469 transitions. [2023-08-31 23:26:35,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4025751072961373 [2023-08-31 23:26:35,865 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 469 transitions. [2023-08-31 23:26:35,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 469 transitions. [2023-08-31 23:26:35,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:35,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 469 transitions. [2023-08-31 23:26:35,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:35,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:35,869 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:35,869 INFO L175 Difference]: Start difference. First operand has 41 places, 22 transitions, 80 flow. Second operand 5 states and 469 transitions. [2023-08-31 23:26:35,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 25 transitions, 127 flow [2023-08-31 23:26:35,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 25 transitions, 115 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-08-31 23:26:35,871 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 66 flow [2023-08-31 23:26:35,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2023-08-31 23:26:35,871 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2023-08-31 23:26:35,872 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 21 transitions, 66 flow [2023-08-31 23:26:35,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:35,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:35,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:35,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:26:35,873 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:26:35,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:35,873 INFO L85 PathProgramCache]: Analyzing trace with hash -400918006, now seen corresponding path program 1 times [2023-08-31 23:26:35,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:26:35,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421436170] [2023-08-31 23:26:35,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:35,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:26:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:36,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:36,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:26:36,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421436170] [2023-08-31 23:26:36,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421436170] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:36,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:36,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:26:36,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884536857] [2023-08-31 23:26:36,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:36,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:26:36,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:26:36,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:26:36,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:26:36,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 233 [2023-08-31 23:26:36,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 21 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:36,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:36,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 233 [2023-08-31 23:26:36,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:36,256 INFO L130 PetriNetUnfolder]: 345/587 cut-off events. [2023-08-31 23:26:36,256 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2023-08-31 23:26:36,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1378 conditions, 587 events. 345/587 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2490 event pairs, 64 based on Foata normal form. 65/647 useless extension candidates. Maximal degree in co-relation 1371. Up to 341 conditions per place. [2023-08-31 23:26:36,259 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 27 selfloop transitions, 4 changer transitions 21/54 dead transitions. [2023-08-31 23:26:36,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 54 transitions, 258 flow [2023-08-31 23:26:36,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:26:36,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:26:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2023-08-31 23:26:36,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45836909871244635 [2023-08-31 23:26:36,262 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 534 transitions. [2023-08-31 23:26:36,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 534 transitions. [2023-08-31 23:26:36,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:36,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 534 transitions. [2023-08-31 23:26:36,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:36,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:36,266 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:36,266 INFO L175 Difference]: Start difference. First operand has 36 places, 21 transitions, 66 flow. Second operand 5 states and 534 transitions. [2023-08-31 23:26:36,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 54 transitions, 258 flow [2023-08-31 23:26:36,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 54 transitions, 252 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:26:36,268 INFO L231 Difference]: Finished difference. Result has 40 places, 24 transitions, 97 flow [2023-08-31 23:26:36,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=97, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2023-08-31 23:26:36,268 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-31 23:26:36,269 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 97 flow [2023-08-31 23:26:36,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:36,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:36,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:36,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:26:36,270 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:26:36,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:36,270 INFO L85 PathProgramCache]: Analyzing trace with hash 200057387, now seen corresponding path program 1 times [2023-08-31 23:26:36,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:26:36,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209111309] [2023-08-31 23:26:36,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:36,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:26:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:36,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:26:36,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209111309] [2023-08-31 23:26:36,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209111309] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:36,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:36,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:26:36,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033182829] [2023-08-31 23:26:36,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:36,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:26:36,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:26:36,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:26:36,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:26:36,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 233 [2023-08-31 23:26:36,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:36,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:36,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 233 [2023-08-31 23:26:36,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:36,641 INFO L130 PetriNetUnfolder]: 162/310 cut-off events. [2023-08-31 23:26:36,641 INFO L131 PetriNetUnfolder]: For 151/151 co-relation queries the response was YES. [2023-08-31 23:26:36,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 310 events. 162/310 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1191 event pairs, 35 based on Foata normal form. 37/342 useless extension candidates. Maximal degree in co-relation 946. Up to 118 conditions per place. [2023-08-31 23:26:36,643 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 33 selfloop transitions, 7 changer transitions 20/62 dead transitions. [2023-08-31 23:26:36,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 62 transitions, 355 flow [2023-08-31 23:26:36,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:26:36,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:26:36,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 638 transitions. [2023-08-31 23:26:36,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4563662374821173 [2023-08-31 23:26:36,646 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 638 transitions. [2023-08-31 23:26:36,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 638 transitions. [2023-08-31 23:26:36,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:36,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 638 transitions. [2023-08-31 23:26:36,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.33333333333333) internal successors, (638), 6 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:36,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:36,650 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:36,650 INFO L175 Difference]: Start difference. First operand has 40 places, 24 transitions, 97 flow. Second operand 6 states and 638 transitions. [2023-08-31 23:26:36,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 62 transitions, 355 flow [2023-08-31 23:26:36,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 62 transitions, 349 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:26:36,652 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 147 flow [2023-08-31 23:26:36,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=147, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2023-08-31 23:26:36,653 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-08-31 23:26:36,653 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 147 flow [2023-08-31 23:26:36,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:36,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:36,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:36,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:26:36,655 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:26:36,655 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:36,655 INFO L85 PathProgramCache]: Analyzing trace with hash -195980239, now seen corresponding path program 1 times [2023-08-31 23:26:36,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:26:36,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663426468] [2023-08-31 23:26:36,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:36,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:26:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:36,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:36,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:26:36,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663426468] [2023-08-31 23:26:36,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663426468] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:36,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:36,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:26:36,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709421112] [2023-08-31 23:26:36,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:36,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:26:36,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:26:36,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:26:36,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:26:36,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 233 [2023-08-31 23:26:36,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 147 flow. Second operand has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:36,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:36,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 233 [2023-08-31 23:26:36,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:37,097 INFO L130 PetriNetUnfolder]: 94/191 cut-off events. [2023-08-31 23:26:37,098 INFO L131 PetriNetUnfolder]: For 207/207 co-relation queries the response was YES. [2023-08-31 23:26:37,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 191 events. 94/191 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 636 event pairs, 32 based on Foata normal form. 10/196 useless extension candidates. Maximal degree in co-relation 633. Up to 71 conditions per place. [2023-08-31 23:26:37,100 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 30 selfloop transitions, 10 changer transitions 10/52 dead transitions. [2023-08-31 23:26:37,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 344 flow [2023-08-31 23:26:37,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:26:37,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:26:37,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 724 transitions. [2023-08-31 23:26:37,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4438994481912937 [2023-08-31 23:26:37,103 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 724 transitions. [2023-08-31 23:26:37,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 724 transitions. [2023-08-31 23:26:37,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:37,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 724 transitions. [2023-08-31 23:26:37,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.42857142857143) internal successors, (724), 7 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:37,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:37,108 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:37,108 INFO L175 Difference]: Start difference. First operand has 44 places, 27 transitions, 147 flow. Second operand 7 states and 724 transitions. [2023-08-31 23:26:37,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 344 flow [2023-08-31 23:26:37,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 293 flow, removed 16 selfloop flow, removed 6 redundant places. [2023-08-31 23:26:37,112 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 141 flow [2023-08-31 23:26:37,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=141, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2023-08-31 23:26:37,112 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2023-08-31 23:26:37,112 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 141 flow [2023-08-31 23:26:37,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:37,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:37,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:37,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:26:37,114 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:26:37,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:37,114 INFO L85 PathProgramCache]: Analyzing trace with hash -691122682, now seen corresponding path program 1 times [2023-08-31 23:26:37,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:26:37,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400380221] [2023-08-31 23:26:37,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:37,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:26:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:38,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:38,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:26:38,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400380221] [2023-08-31 23:26:38,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400380221] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:38,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:38,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:26:38,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9585188] [2023-08-31 23:26:38,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:38,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:26:38,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:26:38,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:26:38,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:26:38,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 233 [2023-08-31 23:26:38,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 27 transitions, 141 flow. Second operand has 8 states, 8 states have (on average 101.5) internal successors, (812), 8 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:38,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:38,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 233 [2023-08-31 23:26:38,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:38,556 INFO L130 PetriNetUnfolder]: 135/278 cut-off events. [2023-08-31 23:26:38,557 INFO L131 PetriNetUnfolder]: For 375/375 co-relation queries the response was YES. [2023-08-31 23:26:38,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 841 conditions, 278 events. 135/278 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1106 event pairs, 5 based on Foata normal form. 1/279 useless extension candidates. Maximal degree in co-relation 830. Up to 132 conditions per place. [2023-08-31 23:26:38,558 INFO L137 encePairwiseOnDemand]: 226/233 looper letters, 51 selfloop transitions, 13 changer transitions 10/75 dead transitions. [2023-08-31 23:26:38,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 75 transitions, 551 flow [2023-08-31 23:26:38,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:26:38,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:26:38,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 948 transitions. [2023-08-31 23:26:38,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4520743919885551 [2023-08-31 23:26:38,562 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 948 transitions. [2023-08-31 23:26:38,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 948 transitions. [2023-08-31 23:26:38,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:38,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 948 transitions. [2023-08-31 23:26:38,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 105.33333333333333) internal successors, (948), 9 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:38,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 233.0) internal successors, (2330), 10 states have internal predecessors, (2330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:38,569 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 233.0) internal successors, (2330), 10 states have internal predecessors, (2330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:38,569 INFO L175 Difference]: Start difference. First operand has 45 places, 27 transitions, 141 flow. Second operand 9 states and 948 transitions. [2023-08-31 23:26:38,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 75 transitions, 551 flow [2023-08-31 23:26:38,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 75 transitions, 455 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-08-31 23:26:38,573 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 155 flow [2023-08-31 23:26:38,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=155, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-31 23:26:38,575 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-08-31 23:26:38,575 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 155 flow [2023-08-31 23:26:38,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 101.5) internal successors, (812), 8 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:38,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:38,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:38,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:26:38,576 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:26:38,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:38,576 INFO L85 PathProgramCache]: Analyzing trace with hash -908813074, now seen corresponding path program 2 times [2023-08-31 23:26:38,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:26:38,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417436354] [2023-08-31 23:26:38,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:38,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:26:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:38,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:38,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:26:38,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417436354] [2023-08-31 23:26:38,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417436354] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:38,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:38,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:26:38,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136190687] [2023-08-31 23:26:38,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:38,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:26:38,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:26:38,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:26:38,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:26:38,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 233 [2023-08-31 23:26:38,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:38,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:38,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 233 [2023-08-31 23:26:38,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:38,924 INFO L130 PetriNetUnfolder]: 214/417 cut-off events. [2023-08-31 23:26:38,925 INFO L131 PetriNetUnfolder]: For 365/376 co-relation queries the response was YES. [2023-08-31 23:26:38,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1335 conditions, 417 events. 214/417 cut-off events. For 365/376 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1828 event pairs, 63 based on Foata normal form. 11/419 useless extension candidates. Maximal degree in co-relation 1326. Up to 220 conditions per place. [2023-08-31 23:26:38,926 INFO L137 encePairwiseOnDemand]: 230/233 looper letters, 27 selfloop transitions, 1 changer transitions 30/59 dead transitions. [2023-08-31 23:26:38,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 373 flow [2023-08-31 23:26:38,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:26:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:26:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 435 transitions. [2023-08-31 23:26:38,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4667381974248927 [2023-08-31 23:26:38,929 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 435 transitions. [2023-08-31 23:26:38,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 435 transitions. [2023-08-31 23:26:38,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:38,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 435 transitions. [2023-08-31 23:26:38,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:38,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:38,932 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:38,932 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 155 flow. Second operand 4 states and 435 transitions. [2023-08-31 23:26:38,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 373 flow [2023-08-31 23:26:38,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:26:38,935 INFO L231 Difference]: Finished difference. Result has 49 places, 29 transitions, 131 flow [2023-08-31 23:26:38,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=49, PETRI_TRANSITIONS=29} [2023-08-31 23:26:38,937 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2023-08-31 23:26:38,937 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 29 transitions, 131 flow [2023-08-31 23:26:38,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:38,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:38,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:38,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:26:38,938 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:26:38,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:38,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1693538374, now seen corresponding path program 3 times [2023-08-31 23:26:38,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:26:38,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514265340] [2023-08-31 23:26:38,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:38,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:26:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:26:38,998 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:26:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:26:39,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:26:39,112 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:26:39,113 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-31 23:26:39,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-31 23:26:39,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-31 23:26:39,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-31 23:26:39,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-31 23:26:39,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-31 23:26:39,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-31 23:26:39,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-31 23:26:39,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-31 23:26:39,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-31 23:26:39,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-31 23:26:39,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-31 23:26:39,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-31 23:26:39,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:26:39,116 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:39,122 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:26:39,122 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:26:39,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:26:39 BasicIcfg [2023-08-31 23:26:39,182 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:26:39,182 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:26:39,183 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:26:39,183 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:26:39,183 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:26:24" (3/4) ... [2023-08-31 23:26:39,185 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:26:39,185 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:26:39,186 INFO L158 Benchmark]: Toolchain (without parser) took 16386.96ms. Allocated memory was 67.1MB in the beginning and 331.4MB in the end (delta: 264.2MB). Free memory was 43.7MB in the beginning and 198.2MB in the end (delta: -154.5MB). Peak memory consumption was 110.9MB. Max. memory is 16.1GB. [2023-08-31 23:26:39,186 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 54.5MB. Free memory was 32.5MB in the beginning and 32.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:26:39,186 INFO L158 Benchmark]: CACSL2BoogieTranslator took 613.09ms. Allocated memory is still 67.1MB. Free memory was 43.5MB in the beginning and 36.2MB in the end (delta: 7.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-31 23:26:39,186 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.15ms. Allocated memory is still 67.1MB. Free memory was 36.2MB in the beginning and 33.0MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:26:39,187 INFO L158 Benchmark]: Boogie Preprocessor took 63.10ms. Allocated memory is still 67.1MB. Free memory was 33.0MB in the beginning and 30.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:26:39,187 INFO L158 Benchmark]: RCFGBuilder took 825.26ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 30.9MB in the beginning and 54.6MB in the end (delta: -23.7MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2023-08-31 23:26:39,187 INFO L158 Benchmark]: TraceAbstraction took 14824.15ms. Allocated memory was 81.8MB in the beginning and 331.4MB in the end (delta: 249.6MB). Free memory was 53.6MB in the beginning and 199.2MB in the end (delta: -145.6MB). Peak memory consumption was 103.9MB. Max. memory is 16.1GB. [2023-08-31 23:26:39,188 INFO L158 Benchmark]: Witness Printer took 3.06ms. Allocated memory is still 331.4MB. Free memory was 199.2MB in the beginning and 198.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:26:39,190 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.29ms. Allocated memory is still 54.5MB. Free memory was 32.5MB in the beginning and 32.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 613.09ms. Allocated memory is still 67.1MB. Free memory was 43.5MB in the beginning and 36.2MB in the end (delta: 7.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.15ms. Allocated memory is still 67.1MB. Free memory was 36.2MB in the beginning and 33.0MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.10ms. Allocated memory is still 67.1MB. Free memory was 33.0MB in the beginning and 30.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 825.26ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 30.9MB in the beginning and 54.6MB in the end (delta: -23.7MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14824.15ms. Allocated memory was 81.8MB in the beginning and 331.4MB in the end (delta: 249.6MB). Free memory was 53.6MB in the beginning and 199.2MB in the end (delta: -145.6MB). Peak memory consumption was 103.9MB. Max. memory is 16.1GB. * Witness Printer took 3.06ms. Allocated memory is still 331.4MB. Free memory was 199.2MB in the beginning and 198.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 123 PlacesBefore, 40 PlacesAfterwards, 115 TransitionsBefore, 30 TransitionsAfterwards, 2140 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 115 TotalNumberOfCompositions, 6133 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2081, independent: 1887, independent conditional: 0, independent unconditional: 1887, dependent: 194, dependent conditional: 0, dependent unconditional: 194, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1121, independent: 1085, independent conditional: 0, independent unconditional: 1085, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2081, independent: 802, independent conditional: 0, independent unconditional: 802, dependent: 158, dependent conditional: 0, dependent unconditional: 158, unknown: 1121, unknown conditional: 0, unknown unconditional: 1121] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 75, Positive conditional cache size: 0, Positive unconditional cache size: 75, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1687; [L834] FCALL, FORK 0 pthread_create(&t1687, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1687, ((void *)0), P0, ((void *)0))=0, t1687={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L835] 0 pthread_t t1688; [L836] FCALL, FORK 0 pthread_create(&t1688, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1688, ((void *)0), P1, ((void *)0))=1, t1687={5:0}, t1688={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L837] 0 pthread_t t1689; [L763] 2 y$w_buff1 = y$w_buff0 [L764] 2 y$w_buff0 = 2 [L765] 2 y$w_buff1_used = y$w_buff0_used [L766] 2 y$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L768] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L769] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L770] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L771] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L772] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L838] FCALL, FORK 0 pthread_create(&t1689, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1689, ((void *)0), P2, ((void *)0))=2, t1687={5:0}, t1688={6:0}, t1689={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 y$flush_delayed = weak$$choice2 [L778] 2 y$mem_tmp = y [L779] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L780] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L781] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L782] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L783] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L785] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EAX = y [L787] 2 y = y$flush_delayed ? y$mem_tmp : y [L788] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L791] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L808] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L746] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L749] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L794] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L796] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L797] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1687={5:0}, t1688={6:0}, t1689={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L851] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L852] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L853] 0 y$flush_delayed = weak$$choice2 [L854] 0 y$mem_tmp = y [L855] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L856] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L857] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L858] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L859] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L861] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L863] 0 y = y$flush_delayed ? y$mem_tmp : y [L864] 0 y$flush_delayed = (_Bool)0 [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 831]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 838]: 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: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 145 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 861 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 588 mSDsluCounter, 258 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 151 mSDsCounter, 119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2364 IncrementalHoareTripleChecker+Invalid, 2483 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 119 mSolverCounterUnsat, 107 mSDtfsCounter, 2364 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=12, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 1648 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:26:39,216 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/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 596bf38d5c1bddbb7fa933c2910678824d7396d44da5246db401a53a5b4ba843 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:26:41,016 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:26:41,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:26:41,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:26:41,054 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:26:41,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:26:41,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:26:41,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:26:41,063 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:26:41,068 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:26:41,069 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:26:41,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:26:41,072 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:26:41,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:26:41,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:26:41,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:26:41,081 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:26:41,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:26:41,083 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:26:41,084 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:26:41,085 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:26:41,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:26:41,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:26:41,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:26:41,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:26:41,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:26:41,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:26:41,091 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:26:41,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:26:41,092 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:26:41,093 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:26:41,093 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:26:41,094 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:26:41,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:26:41,095 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:26:41,096 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:26:41,096 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:26:41,096 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:26:41,097 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:26:41,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:26:41,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:26:41,099 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:26:41,129 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:26:41,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:26:41,130 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:26:41,130 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:26:41,131 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:26:41,131 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:26:41,132 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:26:41,132 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:26:41,132 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:26:41,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:26:41,133 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:26:41,133 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:26:41,133 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:26:41,133 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:26:41,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:26:41,134 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:26:41,134 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:26:41,134 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:26:41,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:26:41,135 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:26:41,135 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:26:41,135 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:26:41,136 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:26:41,136 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:26:41,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:26:41,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:26:41,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:26:41,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:26:41,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:26:41,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:26:41,138 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:26:41,138 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:26:41,138 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:26:41,138 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:26:41,138 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:26:41,139 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:26:41,139 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:26:41,139 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 -> 596bf38d5c1bddbb7fa933c2910678824d7396d44da5246db401a53a5b4ba843 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:26:41,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:26:41,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:26:41,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:26:41,458 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:26:41,458 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:26:41,460 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2023-08-31 23:26:42,634 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:26:42,911 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:26:42,915 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2023-08-31 23:26:42,935 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbae36409/f92e94e6681a46fdbc47f851c6477f63/FLAG134b21225 [2023-08-31 23:26:42,953 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbae36409/f92e94e6681a46fdbc47f851c6477f63 [2023-08-31 23:26:42,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:26:42,956 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:26:42,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:26:42,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:26:42,960 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:26:42,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:26:42" (1/1) ... [2023-08-31 23:26:42,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ec3f422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:42, skipping insertion in model container [2023-08-31 23:26:42,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:26:42" (1/1) ... [2023-08-31 23:26:42,967 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:26:43,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:26:43,125 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/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i[974,987] [2023-08-31 23:26:43,332 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:26:43,345 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:26:43,357 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/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i[974,987] [2023-08-31 23:26:43,421 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:26:43,448 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:26:43,451 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:26:43,456 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:26:43,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:43 WrapperNode [2023-08-31 23:26:43,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:26:43,458 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:26:43,458 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:26:43,458 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:26:43,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:43" (1/1) ... [2023-08-31 23:26:43,497 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:43" (1/1) ... [2023-08-31 23:26:43,527 INFO L138 Inliner]: procedures = 179, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2023-08-31 23:26:43,527 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:26:43,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:26:43,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:26:43,528 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:26:43,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:43" (1/1) ... [2023-08-31 23:26:43,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:43" (1/1) ... [2023-08-31 23:26:43,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:43" (1/1) ... [2023-08-31 23:26:43,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:43" (1/1) ... [2023-08-31 23:26:43,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:43" (1/1) ... [2023-08-31 23:26:43,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:43" (1/1) ... [2023-08-31 23:26:43,553 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:43" (1/1) ... [2023-08-31 23:26:43,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:43" (1/1) ... [2023-08-31 23:26:43,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:26:43,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:26:43,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:26:43,558 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:26:43,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:43" (1/1) ... [2023-08-31 23:26:43,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:26:43,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:26:43,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:26:43,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:26:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:26:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:26:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:26:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:26:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:26:43,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:26:43,621 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:26:43,621 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:26:43,621 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:26:43,621 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:26:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:26:43,622 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:26:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:26:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:26:43,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:26:43,624 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:26:43,739 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:26:43,740 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:26:44,180 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:26:44,321 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:26:44,321 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:26:44,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:26:44 BoogieIcfgContainer [2023-08-31 23:26:44,323 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:26:44,324 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:26:44,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:26:44,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:26:44,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:26:42" (1/3) ... [2023-08-31 23:26:44,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e605e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:26:44, skipping insertion in model container [2023-08-31 23:26:44,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:43" (2/3) ... [2023-08-31 23:26:44,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e605e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:26:44, skipping insertion in model container [2023-08-31 23:26:44,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:26:44" (3/3) ... [2023-08-31 23:26:44,332 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2023-08-31 23:26:44,342 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:26:44,342 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-31 23:26:44,342 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:26:44,387 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:26:44,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 253 flow [2023-08-31 23:26:44,480 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2023-08-31 23:26:44,480 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:26:44,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-31 23:26:44,485 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 119 transitions, 253 flow [2023-08-31 23:26:44,490 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 116 transitions, 241 flow [2023-08-31 23:26:44,493 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:26:44,512 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 116 transitions, 241 flow [2023-08-31 23:26:44,514 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 116 transitions, 241 flow [2023-08-31 23:26:44,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 241 flow [2023-08-31 23:26:44,546 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2023-08-31 23:26:44,546 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:26:44,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-31 23:26:44,548 INFO L119 LiptonReduction]: Number of co-enabled transitions 2140 [2023-08-31 23:26:50,053 INFO L134 LiptonReduction]: Checked pairs total: 5741 [2023-08-31 23:26:50,053 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-31 23:26:50,064 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:26:50,068 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;@1169e5fb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:26:50,068 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-31 23:26:50,070 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:26:50,070 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:26:50,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:50,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:26:50,070 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:26:50,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:50,073 INFO L85 PathProgramCache]: Analyzing trace with hash 555, now seen corresponding path program 1 times [2023-08-31 23:26:50,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:26:50,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541181314] [2023-08-31 23:26:50,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:50,083 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:26:50,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:26:50,084 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:26:50,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-31 23:26:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:50,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:26:50,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:26:50,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:50,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:26:50,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:26:50,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541181314] [2023-08-31 23:26:50,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541181314] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:50,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:50,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:26:50,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530193216] [2023-08-31 23:26:50,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:50,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:26:50,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:26:50,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:26:50,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:26:50,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 235 [2023-08-31 23:26:50,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:50,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:50,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 235 [2023-08-31 23:26:50,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:50,805 INFO L130 PetriNetUnfolder]: 1555/2297 cut-off events. [2023-08-31 23:26:50,805 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2023-08-31 23:26:50,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4644 conditions, 2297 events. 1555/2297 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 10592 event pairs, 1555 based on Foata normal form. 0/1976 useless extension candidates. Maximal degree in co-relation 4633. Up to 2285 conditions per place. [2023-08-31 23:26:50,821 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 23 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-08-31 23:26:50,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 105 flow [2023-08-31 23:26:50,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:26:50,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:26:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 240 transitions. [2023-08-31 23:26:50,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2023-08-31 23:26:50,833 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 240 transitions. [2023-08-31 23:26:50,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 240 transitions. [2023-08-31 23:26:50,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:50,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 240 transitions. [2023-08-31 23:26:50,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 120.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:50,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:50,842 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:50,844 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 240 transitions. [2023-08-31 23:26:50,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 105 flow [2023-08-31 23:26:50,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:26:50,848 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-08-31 23:26:50,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-31 23:26:50,852 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-08-31 23:26:50,852 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-08-31 23:26:50,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:50,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:50,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 23:26:50,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-31 23:26:51,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:26:51,068 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:26:51,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:51,069 INFO L85 PathProgramCache]: Analyzing trace with hash 526991932, now seen corresponding path program 1 times [2023-08-31 23:26:51,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:26:51,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371110618] [2023-08-31 23:26:51,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:51,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:26:51,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:26:51,071 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:26:51,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-31 23:26:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:51,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:26:51,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:26:51,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:51,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:26:51,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:26:51,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371110618] [2023-08-31 23:26:51,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371110618] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:51,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:51,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:26:51,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944475424] [2023-08-31 23:26:51,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:51,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:26:51,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:26:51,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:26:51,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:26:51,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 235 [2023-08-31 23:26:51,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:51,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:51,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 235 [2023-08-31 23:26:51,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:51,468 INFO L130 PetriNetUnfolder]: 1277/2007 cut-off events. [2023-08-31 23:26:51,468 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:26:51,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3946 conditions, 2007 events. 1277/2007 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10363 event pairs, 165 based on Foata normal form. 0/1846 useless extension candidates. Maximal degree in co-relation 3943. Up to 1593 conditions per place. [2023-08-31 23:26:51,477 INFO L137 encePairwiseOnDemand]: 232/235 looper letters, 32 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2023-08-31 23:26:51,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 38 transitions, 156 flow [2023-08-31 23:26:51,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:26:51,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:26:51,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2023-08-31 23:26:51,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4950354609929078 [2023-08-31 23:26:51,480 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2023-08-31 23:26:51,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2023-08-31 23:26:51,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:51,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2023-08-31 23:26:51,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:51,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:51,486 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:51,486 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 349 transitions. [2023-08-31 23:26:51,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 38 transitions, 156 flow [2023-08-31 23:26:51,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 38 transitions, 156 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:26:51,487 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2023-08-31 23:26:51,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2023-08-31 23:26:51,488 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-31 23:26:51,488 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2023-08-31 23:26:51,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:51,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:51,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:51,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-31 23:26:51,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:26:51,698 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:26:51,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:51,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1984848137, now seen corresponding path program 1 times [2023-08-31 23:26:51,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:26:51,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458488491] [2023-08-31 23:26:51,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:51,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:26:51,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:26:51,703 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:26:51,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-31 23:26:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:51,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:26:51,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:26:51,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:51,840 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:26:51,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:26:51,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458488491] [2023-08-31 23:26:51,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458488491] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:51,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:51,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:26:51,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706620506] [2023-08-31 23:26:51,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:51,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:26:51,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:26:51,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:26:51,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:26:51,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 235 [2023-08-31 23:26:51,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:51,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:51,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 235 [2023-08-31 23:26:51,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:52,105 INFO L130 PetriNetUnfolder]: 693/1129 cut-off events. [2023-08-31 23:26:52,105 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2023-08-31 23:26:52,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2381 conditions, 1129 events. 693/1129 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5263 event pairs, 140 based on Foata normal form. 80/1161 useless extension candidates. Maximal degree in co-relation 2377. Up to 758 conditions per place. [2023-08-31 23:26:52,110 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 31 selfloop transitions, 4 changer transitions 21/58 dead transitions. [2023-08-31 23:26:52,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 58 transitions, 248 flow [2023-08-31 23:26:52,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:26:52,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:26:52,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 558 transitions. [2023-08-31 23:26:52,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4748936170212766 [2023-08-31 23:26:52,115 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 558 transitions. [2023-08-31 23:26:52,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 558 transitions. [2023-08-31 23:26:52,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:52,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 558 transitions. [2023-08-31 23:26:52,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:52,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:52,123 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:52,123 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 5 states and 558 transitions. [2023-08-31 23:26:52,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 58 transitions, 248 flow [2023-08-31 23:26:52,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 58 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:26:52,126 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 88 flow [2023-08-31 23:26:52,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-08-31 23:26:52,128 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-08-31 23:26:52,128 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 88 flow [2023-08-31 23:26:52,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:52,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:52,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:52,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-31 23:26:52,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:26:52,338 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:26:52,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:52,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1944795640, now seen corresponding path program 1 times [2023-08-31 23:26:52,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:26:52,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723065442] [2023-08-31 23:26:52,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:52,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:26:52,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:26:52,342 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:26:52,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-31 23:26:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:52,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:26:52,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:26:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:52,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:26:52,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:26:52,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723065442] [2023-08-31 23:26:52,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723065442] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:52,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:52,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:26:52,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62756642] [2023-08-31 23:26:52,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:52,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:26:52,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:26:52,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:26:52,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:26:52,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 235 [2023-08-31 23:26:52,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:52,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:52,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 235 [2023-08-31 23:26:52,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:52,678 INFO L130 PetriNetUnfolder]: 288/526 cut-off events. [2023-08-31 23:26:52,679 INFO L131 PetriNetUnfolder]: For 159/159 co-relation queries the response was YES. [2023-08-31 23:26:52,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1394 conditions, 526 events. 288/526 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2206 event pairs, 83 based on Foata normal form. 44/555 useless extension candidates. Maximal degree in co-relation 1387. Up to 159 conditions per place. [2023-08-31 23:26:52,681 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 40 selfloop transitions, 7 changer transitions 21/70 dead transitions. [2023-08-31 23:26:52,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 70 transitions, 356 flow [2023-08-31 23:26:52,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:26:52,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:26:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 670 transitions. [2023-08-31 23:26:52,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475177304964539 [2023-08-31 23:26:52,684 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 670 transitions. [2023-08-31 23:26:52,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 670 transitions. [2023-08-31 23:26:52,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:52,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 670 transitions. [2023-08-31 23:26:52,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.66666666666667) internal successors, (670), 6 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:52,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:52,689 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:52,690 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 88 flow. Second operand 6 states and 670 transitions. [2023-08-31 23:26:52,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 70 transitions, 356 flow [2023-08-31 23:26:52,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 70 transitions, 350 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:26:52,693 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 138 flow [2023-08-31 23:26:52,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-31 23:26:52,693 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-08-31 23:26:52,694 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 138 flow [2023-08-31 23:26:52,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:52,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:52,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:52,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-31 23:26:52,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:26:52,904 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:26:52,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:52,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1950948959, now seen corresponding path program 1 times [2023-08-31 23:26:52,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:26:52,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442782545] [2023-08-31 23:26:52,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:52,905 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:26:52,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:26:52,906 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:26:52,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-31 23:26:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:53,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:26:53,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:26:53,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:53,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:26:53,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:26:53,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442782545] [2023-08-31 23:26:53,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442782545] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:53,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:53,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:26:53,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964451092] [2023-08-31 23:26:53,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:53,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:26:53,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:26:53,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:26:53,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:26:53,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 235 [2023-08-31 23:26:53,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:53,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:53,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 235 [2023-08-31 23:26:53,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:53,326 INFO L130 PetriNetUnfolder]: 182/337 cut-off events. [2023-08-31 23:26:53,327 INFO L131 PetriNetUnfolder]: For 298/298 co-relation queries the response was YES. [2023-08-31 23:26:53,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 337 events. 182/337 cut-off events. For 298/298 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1296 event pairs, 78 based on Foata normal form. 11/343 useless extension candidates. Maximal degree in co-relation 959. Up to 145 conditions per place. [2023-08-31 23:26:53,329 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 37 selfloop transitions, 10 changer transitions 11/60 dead transitions. [2023-08-31 23:26:53,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 350 flow [2023-08-31 23:26:53,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:26:53,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:26:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 760 transitions. [2023-08-31 23:26:53,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46200607902735563 [2023-08-31 23:26:53,332 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 760 transitions. [2023-08-31 23:26:53,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 760 transitions. [2023-08-31 23:26:53,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:53,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 760 transitions. [2023-08-31 23:26:53,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.57142857142857) internal successors, (760), 7 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:53,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:53,337 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:53,337 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 138 flow. Second operand 7 states and 760 transitions. [2023-08-31 23:26:53,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 350 flow [2023-08-31 23:26:53,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 314 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-31 23:26:53,341 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 140 flow [2023-08-31 23:26:53,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2023-08-31 23:26:53,342 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-08-31 23:26:53,342 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 140 flow [2023-08-31 23:26:53,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:53,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:53,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:53,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-31 23:26:53,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:26:53,543 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:26:53,544 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:53,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1884774533, now seen corresponding path program 1 times [2023-08-31 23:26:53,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:26:53,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892823323] [2023-08-31 23:26:53,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:53,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:26:53,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:26:53,546 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:26:53,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-31 23:26:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:53,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:26:53,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:26:54,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:54,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:26:54,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:26:54,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892823323] [2023-08-31 23:26:54,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [892823323] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:54,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:54,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:26:54,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307385847] [2023-08-31 23:26:54,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:54,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:26:54,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:26:54,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:26:54,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:26:54,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 235 [2023-08-31 23:26:54,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:54,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:54,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 235 [2023-08-31 23:26:54,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:54,285 INFO L130 PetriNetUnfolder]: 224/435 cut-off events. [2023-08-31 23:26:54,286 INFO L131 PetriNetUnfolder]: For 466/466 co-relation queries the response was YES. [2023-08-31 23:26:54,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1233 conditions, 435 events. 224/435 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1893 event pairs, 77 based on Foata normal form. 0/433 useless extension candidates. Maximal degree in co-relation 1223. Up to 149 conditions per place. [2023-08-31 23:26:54,289 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 50 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2023-08-31 23:26:54,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 396 flow [2023-08-31 23:26:54,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:26:54,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:26:54,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 541 transitions. [2023-08-31 23:26:54,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4604255319148936 [2023-08-31 23:26:54,291 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 541 transitions. [2023-08-31 23:26:54,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 541 transitions. [2023-08-31 23:26:54,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:54,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 541 transitions. [2023-08-31 23:26:54,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:54,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:54,295 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:54,295 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 140 flow. Second operand 5 states and 541 transitions. [2023-08-31 23:26:54,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 396 flow [2023-08-31 23:26:54,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 316 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-08-31 23:26:54,298 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 124 flow [2023-08-31 23:26:54,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2023-08-31 23:26:54,299 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-31 23:26:54,299 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 124 flow [2023-08-31 23:26:54,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:54,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:54,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:54,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-08-31 23:26:54,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:26:54,510 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:26:54,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:54,510 INFO L85 PathProgramCache]: Analyzing trace with hash -77995667, now seen corresponding path program 1 times [2023-08-31 23:26:54,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:26:54,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78614663] [2023-08-31 23:26:54,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:54,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:26:54,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:26:54,512 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:26:54,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-31 23:26:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:54,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-31 23:26:54,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:26:54,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:54,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:26:54,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:26:54,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78614663] [2023-08-31 23:26:54,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78614663] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:54,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:54,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:26:54,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383273533] [2023-08-31 23:26:54,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:54,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:26:54,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:26:54,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:26:54,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:26:55,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 235 [2023-08-31 23:26:55,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:55,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:55,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 235 [2023-08-31 23:26:55,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:55,419 INFO L130 PetriNetUnfolder]: 224/412 cut-off events. [2023-08-31 23:26:55,419 INFO L131 PetriNetUnfolder]: For 238/238 co-relation queries the response was YES. [2023-08-31 23:26:55,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1179 conditions, 412 events. 224/412 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1706 event pairs, 75 based on Foata normal form. 2/413 useless extension candidates. Maximal degree in co-relation 1170. Up to 358 conditions per place. [2023-08-31 23:26:55,421 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 27 selfloop transitions, 3 changer transitions 10/42 dead transitions. [2023-08-31 23:26:55,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 42 transitions, 250 flow [2023-08-31 23:26:55,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:26:55,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:26:55,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2023-08-31 23:26:55,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4051063829787234 [2023-08-31 23:26:55,424 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 476 transitions. [2023-08-31 23:26:55,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 476 transitions. [2023-08-31 23:26:55,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:55,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 476 transitions. [2023-08-31 23:26:55,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:55,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:55,427 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:55,427 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 124 flow. Second operand 5 states and 476 transitions. [2023-08-31 23:26:55,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 42 transitions, 250 flow [2023-08-31 23:26:55,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 42 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:26:55,430 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 114 flow [2023-08-31 23:26:55,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-08-31 23:26:55,431 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2023-08-31 23:26:55,431 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 114 flow [2023-08-31 23:26:55,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:55,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:55,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:55,442 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-31 23:26:55,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:26:55,643 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:26:55,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:55,644 INFO L85 PathProgramCache]: Analyzing trace with hash -636980707, now seen corresponding path program 2 times [2023-08-31 23:26:55,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:26:55,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771921565] [2023-08-31 23:26:55,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:26:55,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:26:55,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:26:55,646 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:26:55,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-31 23:26:55,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:26:55,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:26:55,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:26:55,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:26:56,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:56,141 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:26:56,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:26:56,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771921565] [2023-08-31 23:26:56,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [771921565] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:56,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:56,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:26:56,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839212880] [2023-08-31 23:26:56,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:56,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:26:56,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:26:56,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:26:56,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:26:56,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 235 [2023-08-31 23:26:56,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:56,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:56,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 235 [2023-08-31 23:26:56,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:56,298 INFO L130 PetriNetUnfolder]: 145/287 cut-off events. [2023-08-31 23:26:56,298 INFO L131 PetriNetUnfolder]: For 172/172 co-relation queries the response was YES. [2023-08-31 23:26:56,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 818 conditions, 287 events. 145/287 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1108 event pairs, 40 based on Foata normal form. 1/282 useless extension candidates. Maximal degree in co-relation 809. Up to 160 conditions per place. [2023-08-31 23:26:56,300 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 28 selfloop transitions, 1 changer transitions 19/49 dead transitions. [2023-08-31 23:26:56,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 49 transitions, 296 flow [2023-08-31 23:26:56,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:26:56,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:26:56,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 537 transitions. [2023-08-31 23:26:56,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4570212765957447 [2023-08-31 23:26:56,303 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 537 transitions. [2023-08-31 23:26:56,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 537 transitions. [2023-08-31 23:26:56,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:56,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 537 transitions. [2023-08-31 23:26:56,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:56,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:56,306 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:56,306 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 114 flow. Second operand 5 states and 537 transitions. [2023-08-31 23:26:56,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 49 transitions, 296 flow [2023-08-31 23:26:56,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 279 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-31 23:26:56,310 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 110 flow [2023-08-31 23:26:56,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-08-31 23:26:56,312 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2023-08-31 23:26:56,312 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 110 flow [2023-08-31 23:26:56,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:56,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:56,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:56,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-31 23:26:56,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:26:56,524 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:26:56,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:56,524 INFO L85 PathProgramCache]: Analyzing trace with hash -738544421, now seen corresponding path program 3 times [2023-08-31 23:26:56,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:26:56,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500022556] [2023-08-31 23:26:56,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:26:56,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:26:56,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:26:56,528 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:26:56,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-31 23:26:56,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:26:56,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:26:56,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-31 23:26:56,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:26:56,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:56,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:26:56,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:26:56,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500022556] [2023-08-31 23:26:56,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500022556] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:56,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:56,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:26:56,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899375731] [2023-08-31 23:26:56,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:56,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:26:56,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:26:56,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:26:56,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:26:56,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 235 [2023-08-31 23:26:56,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 110 flow. Second operand has 8 states, 8 states have (on average 103.625) internal successors, (829), 8 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:56,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:56,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 235 [2023-08-31 23:26:56,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:57,105 INFO L130 PetriNetUnfolder]: 134/279 cut-off events. [2023-08-31 23:26:57,105 INFO L131 PetriNetUnfolder]: For 179/179 co-relation queries the response was YES. [2023-08-31 23:26:57,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 279 events. 134/279 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1009 event pairs, 55 based on Foata normal form. 1/280 useless extension candidates. Maximal degree in co-relation 778. Up to 165 conditions per place. [2023-08-31 23:26:57,106 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 30 selfloop transitions, 3 changer transitions 11/45 dead transitions. [2023-08-31 23:26:57,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 270 flow [2023-08-31 23:26:57,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:26:57,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:26:57,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2023-08-31 23:26:57,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45787234042553193 [2023-08-31 23:26:57,108 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 538 transitions. [2023-08-31 23:26:57,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 538 transitions. [2023-08-31 23:26:57,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:57,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 538 transitions. [2023-08-31 23:26:57,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:57,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:57,112 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:57,112 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 110 flow. Second operand 5 states and 538 transitions. [2023-08-31 23:26:57,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 270 flow [2023-08-31 23:26:57,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 263 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-31 23:26:57,114 INFO L231 Difference]: Finished difference. Result has 45 places, 28 transitions, 119 flow [2023-08-31 23:26:57,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=45, PETRI_TRANSITIONS=28} [2023-08-31 23:26:57,115 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-08-31 23:26:57,115 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 119 flow [2023-08-31 23:26:57,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 103.625) internal successors, (829), 8 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:26:57,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:57,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:57,129 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 (10)] Forceful destruction successful, exit code 0 [2023-08-31 23:26:57,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:26:57,326 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:26:57,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:57,327 INFO L85 PathProgramCache]: Analyzing trace with hash -101700805, now seen corresponding path program 4 times [2023-08-31 23:26:57,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:26:57,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221612721] [2023-08-31 23:26:57,328 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:26:57,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:26:57,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:26:57,330 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:26:57,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-31 23:26:57,459 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:26:57,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:26:57,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:26:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:26:57,575 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:26:57,575 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:26:57,576 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-31 23:26:57,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-31 23:26:57,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-31 23:26:57,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-31 23:26:57,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-31 23:26:57,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-31 23:26:57,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-31 23:26:57,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-31 23:26:57,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-31 23:26:57,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-31 23:26:57,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-31 23:26:57,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-31 23:26:57,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-31 23:26:57,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-31 23:26:57,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:26:57,791 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:57,794 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:26:57,795 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:26:57,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:26:57 BasicIcfg [2023-08-31 23:26:57,867 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:26:57,867 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:26:57,867 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:26:57,868 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:26:57,869 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:26:44" (3/4) ... [2023-08-31 23:26:57,871 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:26:57,871 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:26:57,871 INFO L158 Benchmark]: Toolchain (without parser) took 14915.26ms. Allocated memory was 81.8MB in the beginning and 209.7MB in the end (delta: 127.9MB). Free memory was 57.3MB in the beginning and 143.5MB in the end (delta: -86.3MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. [2023-08-31 23:26:57,872 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 60.8MB. Free memory is still 38.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:26:57,872 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.13ms. Allocated memory is still 81.8MB. Free memory was 57.1MB in the beginning and 50.7MB in the end (delta: 6.4MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2023-08-31 23:26:57,873 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.14ms. Allocated memory is still 81.8MB. Free memory was 50.7MB in the beginning and 47.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:26:57,874 INFO L158 Benchmark]: Boogie Preprocessor took 29.62ms. Allocated memory is still 81.8MB. Free memory was 47.8MB in the beginning and 45.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:26:57,874 INFO L158 Benchmark]: RCFGBuilder took 764.77ms. Allocated memory is still 81.8MB. Free memory was 45.3MB in the beginning and 53.7MB in the end (delta: -8.4MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2023-08-31 23:26:57,874 INFO L158 Benchmark]: TraceAbstraction took 13542.63ms. Allocated memory was 81.8MB in the beginning and 209.7MB in the end (delta: 127.9MB). Free memory was 53.1MB in the beginning and 143.5MB in the end (delta: -90.5MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2023-08-31 23:26:57,875 INFO L158 Benchmark]: Witness Printer took 3.72ms. Allocated memory is still 209.7MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:26:57,876 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 60.8MB. Free memory is still 38.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.13ms. Allocated memory is still 81.8MB. Free memory was 57.1MB in the beginning and 50.7MB in the end (delta: 6.4MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.14ms. Allocated memory is still 81.8MB. Free memory was 50.7MB in the beginning and 47.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.62ms. Allocated memory is still 81.8MB. Free memory was 47.8MB in the beginning and 45.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 764.77ms. Allocated memory is still 81.8MB. Free memory was 45.3MB in the beginning and 53.7MB in the end (delta: -8.4MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13542.63ms. Allocated memory was 81.8MB in the beginning and 209.7MB in the end (delta: 127.9MB). Free memory was 53.1MB in the beginning and 143.5MB in the end (delta: -90.5MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. * Witness Printer took 3.72ms. Allocated memory is still 209.7MB. Free memory is still 143.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: 5.5s, 124 PlacesBefore, 41 PlacesAfterwards, 116 TransitionsBefore, 32 TransitionsAfterwards, 2140 CoEnabledTransitionPairs, 6 FixpointIterations, 48 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 116 TotalNumberOfCompositions, 5741 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2105, independent: 1946, independent conditional: 0, independent unconditional: 1946, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1081, independent: 1058, independent conditional: 0, independent unconditional: 1058, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2105, independent: 888, independent conditional: 0, independent unconditional: 888, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 1081, unknown conditional: 0, unknown unconditional: 1081] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 85, Positive conditional cache size: 0, Positive unconditional cache size: 85, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1687; [L834] FCALL, FORK 0 pthread_create(&t1687, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1687, ((void *)0), P0, ((void *)0))=0, t1687={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L835] 0 pthread_t t1688; [L836] FCALL, FORK 0 pthread_create(&t1688, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1688, ((void *)0), P1, ((void *)0))=1, t1687={3:0}, t1688={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L837] 0 pthread_t t1689; [L763] 2 y$w_buff1 = y$w_buff0 [L764] 2 y$w_buff0 = 2 [L765] 2 y$w_buff1_used = y$w_buff0_used [L766] 2 y$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L768] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L769] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L770] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L771] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L772] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L838] FCALL, FORK 0 pthread_create(&t1689, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1689, ((void *)0), P2, ((void *)0))=2, t1687={3:0}, t1688={7:0}, t1689={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 y$flush_delayed = weak$$choice2 [L778] 2 y$mem_tmp = y [L779] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L780] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L781] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L782] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L783] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L785] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EAX = y [L787] 2 y = y$flush_delayed ? y$mem_tmp : y [L788] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L791] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L808] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L746] 1 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L749] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L794] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L796] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L797] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1687={3:0}, t1688={7:0}, t1689={15:0}, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L851] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L852] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L853] 0 y$flush_delayed = weak$$choice2 [L854] 0 y$mem_tmp = y [L855] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L856] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L857] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L858] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L859] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L861] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L863] 0 y = y$flush_delayed ? y$mem_tmp : y [L864] 0 y$flush_delayed = (_Bool)0 [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 831]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 838]: 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: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 146 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 374 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 270 mSDsluCounter, 152 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 117 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1207 IncrementalHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 35 mSDtfsCounter, 1207 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=5, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 125 ConstructedInterpolants, 14 QuantifiedInterpolants, 1143 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1148 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:26:57,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample