./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix015.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix015.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 951d1f5e5395236f7d0da1ed6dd6f4a1398d1a8ad75d935345731aeb4389e0e8 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:45:58,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:45:58,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:45:58,829 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:45:58,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:45:58,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:45:58,834 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:45:58,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:45:58,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:45:58,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:45:58,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:45:58,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:45:58,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:45:58,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:45:58,849 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:45:58,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:45:58,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:45:58,856 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:45:58,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:45:58,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:45:58,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:45:58,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:45:58,873 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:45:58,874 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:45:58,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:45:58,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:45:58,881 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:45:58,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:45:58,883 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:45:58,884 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:45:58,884 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:45:58,886 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:45:58,887 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:45:58,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:45:58,889 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:45:58,889 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:45:58,890 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:45:58,890 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:45:58,890 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:45:58,891 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:45:58,891 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:45:58,893 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 02:45:58,925 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:45:58,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:45:58,927 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:45:58,927 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:45:58,928 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:45:58,928 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:45:58,929 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:45:58,929 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:45:58,929 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:45:58,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:45:58,930 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:45:58,930 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:45:58,931 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:45:58,931 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:45:58,931 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:45:58,931 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:45:58,932 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:45:58,932 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:45:58,932 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:45:58,932 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:45:58,933 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:45:58,933 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:45:58,933 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:45:58,933 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:45:58,934 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:45:58,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:45:58,934 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:45:58,934 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:45:58,934 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:45:58,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:45:58,935 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:45:58,935 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:45:58,936 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:45:58,936 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:45:58,936 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 -> 951d1f5e5395236f7d0da1ed6dd6f4a1398d1a8ad75d935345731aeb4389e0e8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 02:45:59,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:45:59,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:45:59,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:45:59,276 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:45:59,276 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:45:59,278 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015.oepc.i [2023-08-30 02:46:00,406 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:46:00,682 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:46:00,683 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015.oepc.i [2023-08-30 02:46:00,714 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f78ab3554/c964d86c2f2246ae8549dfc137a48857/FLAGe2638acc5 [2023-08-30 02:46:00,732 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f78ab3554/c964d86c2f2246ae8549dfc137a48857 [2023-08-30 02:46:00,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:46:00,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:46:00,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:46:00,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:46:00,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:46:00,742 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:46:00" (1/1) ... [2023-08-30 02:46:00,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fad426d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:00, skipping insertion in model container [2023-08-30 02:46:00,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:46:00" (1/1) ... [2023-08-30 02:46:00,748 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:46:00,808 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:46:00,977 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/mix015.oepc.i[945,958] [2023-08-30 02:46:01,210 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:46:01,224 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:46:01,235 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/mix015.oepc.i[945,958] [2023-08-30 02:46:01,293 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:46:01,323 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:46:01,324 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:46:01,329 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:46:01,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:01 WrapperNode [2023-08-30 02:46:01,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:46:01,331 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:46:01,331 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:46:01,331 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:46:01,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:01" (1/1) ... [2023-08-30 02:46:01,351 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:01" (1/1) ... [2023-08-30 02:46:01,373 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2023-08-30 02:46:01,373 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:46:01,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:46:01,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:46:01,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:46:01,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:01" (1/1) ... [2023-08-30 02:46:01,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:01" (1/1) ... [2023-08-30 02:46:01,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:01" (1/1) ... [2023-08-30 02:46:01,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:01" (1/1) ... [2023-08-30 02:46:01,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:01" (1/1) ... [2023-08-30 02:46:01,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:01" (1/1) ... [2023-08-30 02:46:01,399 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:01" (1/1) ... [2023-08-30 02:46:01,400 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:01" (1/1) ... [2023-08-30 02:46:01,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:46:01,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:46:01,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:46:01,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:46:01,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:01" (1/1) ... [2023-08-30 02:46:01,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:46:01,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:46:01,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 02:46:01,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 02:46:01,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:46:01,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:46:01,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:46:01,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:46:01,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:46:01,511 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:46:01,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:46:01,511 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:46:01,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:46:01,512 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:46:01,512 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:46:01,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:46:01,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:46:01,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:46:01,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:46:01,514 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:46:01,696 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:46:01,697 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:46:02,007 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:46:02,110 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:46:02,111 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:46:02,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:46:02 BoogieIcfgContainer [2023-08-30 02:46:02,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:46:02,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:46:02,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:46:02,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:46:02,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:46:00" (1/3) ... [2023-08-30 02:46:02,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6904cf81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:46:02, skipping insertion in model container [2023-08-30 02:46:02,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:01" (2/3) ... [2023-08-30 02:46:02,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6904cf81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:46:02, skipping insertion in model container [2023-08-30 02:46:02,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:46:02" (3/3) ... [2023-08-30 02:46:02,120 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015.oepc.i [2023-08-30 02:46:02,135 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:46:02,136 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-30 02:46:02,136 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:46:02,195 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:46:02,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2023-08-30 02:46:02,287 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2023-08-30 02:46:02,288 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:46:02,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-30 02:46:02,294 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2023-08-30 02:46:02,300 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 122 transitions, 253 flow [2023-08-30 02:46:02,304 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:46:02,318 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 122 transitions, 253 flow [2023-08-30 02:46:02,324 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 122 transitions, 253 flow [2023-08-30 02:46:02,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 253 flow [2023-08-30 02:46:02,367 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2023-08-30 02:46:02,367 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:46:02,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-30 02:46:02,371 INFO L119 LiptonReduction]: Number of co-enabled transitions 2498 [2023-08-30 02:46:06,364 INFO L134 LiptonReduction]: Checked pairs total: 6987 [2023-08-30 02:46:06,365 INFO L136 LiptonReduction]: Total number of compositions: 120 [2023-08-30 02:46:06,377 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:46:06,382 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;@158847fa, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:46:06,383 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-30 02:46:06,384 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:46:06,384 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:46:06,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:06,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:46:06,385 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:06,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:06,390 INFO L85 PathProgramCache]: Analyzing trace with hash 540, now seen corresponding path program 1 times [2023-08-30 02:46:06,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:46:06,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648990480] [2023-08-30 02:46:06,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:06,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:46:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:46:06,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:46:06,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648990480] [2023-08-30 02:46:06,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648990480] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:06,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:06,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:46:06,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183613133] [2023-08-30 02:46:06,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:06,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:46:06,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:46:06,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:46:06,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:46:06,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 245 [2023-08-30 02:46:06,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 79 flow. Second operand has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:06,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:06,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 245 [2023-08-30 02:46:06,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:07,049 INFO L130 PetriNetUnfolder]: 2255/3329 cut-off events. [2023-08-30 02:46:07,049 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-08-30 02:46:07,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6672 conditions, 3329 events. 2255/3329 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 16677 event pairs, 2255 based on Foata normal form. 120/2873 useless extension candidates. Maximal degree in co-relation 6661. Up to 3277 conditions per place. [2023-08-30 02:46:07,076 INFO L137 encePairwiseOnDemand]: 238/245 looper letters, 25 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2023-08-30 02:46:07,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 28 transitions, 115 flow [2023-08-30 02:46:07,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:46:07,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:46:07,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 256 transitions. [2023-08-30 02:46:07,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2023-08-30 02:46:07,090 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 256 transitions. [2023-08-30 02:46:07,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 256 transitions. [2023-08-30 02:46:07,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:07,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 256 transitions. [2023-08-30 02:46:07,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 128.0) internal successors, (256), 2 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:07,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:07,099 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:07,101 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 79 flow. Second operand 2 states and 256 transitions. [2023-08-30 02:46:07,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 28 transitions, 115 flow [2023-08-30 02:46:07,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 28 transitions, 112 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:46:07,105 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2023-08-30 02:46:07,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-08-30 02:46:07,109 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -8 predicate places. [2023-08-30 02:46:07,110 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 62 flow [2023-08-30 02:46:07,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:07,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:07,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:46:07,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:46:07,111 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:07,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:07,112 INFO L85 PathProgramCache]: Analyzing trace with hash 532388, now seen corresponding path program 1 times [2023-08-30 02:46:07,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:46:07,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374639700] [2023-08-30 02:46:07,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:07,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:46:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:46:07,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:46:07,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374639700] [2023-08-30 02:46:07,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374639700] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:07,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:07,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:46:07,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308472769] [2023-08-30 02:46:07,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:07,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:46:07,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:46:07,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:46:07,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:46:07,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 245 [2023-08-30 02:46:07,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:07,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:07,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 245 [2023-08-30 02:46:07,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:07,789 INFO L130 PetriNetUnfolder]: 1851/2750 cut-off events. [2023-08-30 02:46:07,789 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:46:07,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5507 conditions, 2750 events. 1851/2750 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 13361 event pairs, 823 based on Foata normal form. 0/2443 useless extension candidates. Maximal degree in co-relation 5504. Up to 2297 conditions per place. [2023-08-30 02:46:07,802 INFO L137 encePairwiseOnDemand]: 242/245 looper letters, 36 selfloop transitions, 2 changer transitions 4/45 dead transitions. [2023-08-30 02:46:07,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 45 transitions, 184 flow [2023-08-30 02:46:07,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:46:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:46:07,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-08-30 02:46:07,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5115646258503401 [2023-08-30 02:46:07,808 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-08-30 02:46:07,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-08-30 02:46:07,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:07,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-08-30 02:46:07,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:07,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:07,815 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:07,815 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 62 flow. Second operand 3 states and 376 transitions. [2023-08-30 02:46:07,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 45 transitions, 184 flow [2023-08-30 02:46:07,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:46:07,817 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 60 flow [2023-08-30 02:46:07,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-08-30 02:46:07,818 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -7 predicate places. [2023-08-30 02:46:07,818 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 60 flow [2023-08-30 02:46:07,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:07,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:07,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:07,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:46:07,819 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:07,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:07,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1466864290, now seen corresponding path program 1 times [2023-08-30 02:46:07,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:46:07,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186909805] [2023-08-30 02:46:07,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:07,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:46:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:08,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:46:08,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:46:08,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186909805] [2023-08-30 02:46:08,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186909805] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:08,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:08,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:46:08,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708501056] [2023-08-30 02:46:08,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:08,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:46:08,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:46:08,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:46:08,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:46:08,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 245 [2023-08-30 02:46:08,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:08,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:08,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 245 [2023-08-30 02:46:08,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:08,697 INFO L130 PetriNetUnfolder]: 2989/4306 cut-off events. [2023-08-30 02:46:08,697 INFO L131 PetriNetUnfolder]: For 213/213 co-relation queries the response was YES. [2023-08-30 02:46:08,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8905 conditions, 4306 events. 2989/4306 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 19327 event pairs, 1229 based on Foata normal form. 0/4134 useless extension candidates. Maximal degree in co-relation 8901. Up to 2983 conditions per place. [2023-08-30 02:46:08,722 INFO L137 encePairwiseOnDemand]: 238/245 looper letters, 51 selfloop transitions, 9 changer transitions 0/60 dead transitions. [2023-08-30 02:46:08,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 60 transitions, 260 flow [2023-08-30 02:46:08,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:46:08,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:46:08,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 557 transitions. [2023-08-30 02:46:08,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4546938775510204 [2023-08-30 02:46:08,725 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 557 transitions. [2023-08-30 02:46:08,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 557 transitions. [2023-08-30 02:46:08,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:08,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 557 transitions. [2023-08-30 02:46:08,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:08,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:08,731 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:08,731 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 60 flow. Second operand 5 states and 557 transitions. [2023-08-30 02:46:08,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 60 transitions, 260 flow [2023-08-30 02:46:08,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 60 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:46:08,733 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 128 flow [2023-08-30 02:46:08,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-08-30 02:46:08,734 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-08-30 02:46:08,735 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 128 flow [2023-08-30 02:46:08,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:08,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:08,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:08,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:46:08,736 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:08,737 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:08,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1466864205, now seen corresponding path program 1 times [2023-08-30 02:46:08,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:46:08,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831511991] [2023-08-30 02:46:08,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:08,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:46:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:46:09,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:46:09,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831511991] [2023-08-30 02:46:09,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831511991] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:09,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:09,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:46:09,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573657073] [2023-08-30 02:46:09,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:09,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:46:09,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:46:09,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:46:09,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:46:09,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 245 [2023-08-30 02:46:09,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 128 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:09,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:09,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 245 [2023-08-30 02:46:09,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:09,870 INFO L130 PetriNetUnfolder]: 2574/4042 cut-off events. [2023-08-30 02:46:09,871 INFO L131 PetriNetUnfolder]: For 1950/1984 co-relation queries the response was YES. [2023-08-30 02:46:09,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9551 conditions, 4042 events. 2574/4042 cut-off events. For 1950/1984 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 23215 event pairs, 1249 based on Foata normal form. 254/4213 useless extension candidates. Maximal degree in co-relation 9544. Up to 1518 conditions per place. [2023-08-30 02:46:09,899 INFO L137 encePairwiseOnDemand]: 240/245 looper letters, 52 selfloop transitions, 8 changer transitions 4/69 dead transitions. [2023-08-30 02:46:09,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 69 transitions, 352 flow [2023-08-30 02:46:09,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:46:09,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:46:09,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 642 transitions. [2023-08-30 02:46:09,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43673469387755104 [2023-08-30 02:46:09,902 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 642 transitions. [2023-08-30 02:46:09,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 642 transitions. [2023-08-30 02:46:09,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:09,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 642 transitions. [2023-08-30 02:46:09,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:09,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:09,908 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:09,908 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 128 flow. Second operand 6 states and 642 transitions. [2023-08-30 02:46:09,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 69 transitions, 352 flow [2023-08-30 02:46:09,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 69 transitions, 345 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:46:09,912 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 151 flow [2023-08-30 02:46:09,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=151, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2023-08-30 02:46:09,913 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2023-08-30 02:46:09,913 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 151 flow [2023-08-30 02:46:09,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:09,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:09,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:09,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:46:09,914 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:09,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:09,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1388075316, now seen corresponding path program 1 times [2023-08-30 02:46:09,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:46:09,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716829363] [2023-08-30 02:46:09,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:09,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:46:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:46:10,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:46:10,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716829363] [2023-08-30 02:46:10,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716829363] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:10,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:10,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:46:10,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451520391] [2023-08-30 02:46:10,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:10,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:46:10,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:46:10,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:46:10,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:46:10,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 245 [2023-08-30 02:46:10,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:10,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:10,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 245 [2023-08-30 02:46:10,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:10,836 INFO L130 PetriNetUnfolder]: 3814/5603 cut-off events. [2023-08-30 02:46:10,836 INFO L131 PetriNetUnfolder]: For 5020/5020 co-relation queries the response was YES. [2023-08-30 02:46:10,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14442 conditions, 5603 events. 3814/5603 cut-off events. For 5020/5020 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 27447 event pairs, 935 based on Foata normal form. 276/5879 useless extension candidates. Maximal degree in co-relation 14430. Up to 3301 conditions per place. [2023-08-30 02:46:10,875 INFO L137 encePairwiseOnDemand]: 240/245 looper letters, 60 selfloop transitions, 6 changer transitions 4/70 dead transitions. [2023-08-30 02:46:10,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 70 transitions, 421 flow [2023-08-30 02:46:10,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:46:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:46:10,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 559 transitions. [2023-08-30 02:46:10,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4563265306122449 [2023-08-30 02:46:10,878 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 559 transitions. [2023-08-30 02:46:10,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 559 transitions. [2023-08-30 02:46:10,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:10,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 559 transitions. [2023-08-30 02:46:10,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:10,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:10,884 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:10,884 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 151 flow. Second operand 5 states and 559 transitions. [2023-08-30 02:46:10,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 70 transitions, 421 flow [2023-08-30 02:46:10,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 401 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-30 02:46:10,937 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 184 flow [2023-08-30 02:46:10,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=53, PETRI_TRANSITIONS=36} [2023-08-30 02:46:10,938 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2023-08-30 02:46:10,938 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 184 flow [2023-08-30 02:46:10,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:10,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:10,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:10,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:46:10,939 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:10,940 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:10,940 INFO L85 PathProgramCache]: Analyzing trace with hash 871226031, now seen corresponding path program 1 times [2023-08-30 02:46:10,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:46:10,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751127563] [2023-08-30 02:46:10,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:10,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:46:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:11,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:46:11,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:46:11,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751127563] [2023-08-30 02:46:11,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751127563] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:11,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:11,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:46:11,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947103345] [2023-08-30 02:46:11,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:11,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:46:11,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:46:11,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:46:11,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:46:11,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 245 [2023-08-30 02:46:11,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 36 transitions, 184 flow. Second operand has 7 states, 7 states have (on average 95.71428571428571) internal successors, (670), 7 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-30 02:46:11,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:11,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 245 [2023-08-30 02:46:11,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:12,778 INFO L130 PetriNetUnfolder]: 4674/7249 cut-off events. [2023-08-30 02:46:12,779 INFO L131 PetriNetUnfolder]: For 8261/8428 co-relation queries the response was YES. [2023-08-30 02:46:12,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19487 conditions, 7249 events. 4674/7249 cut-off events. For 8261/8428 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 44819 event pairs, 2952 based on Foata normal form. 135/7259 useless extension candidates. Maximal degree in co-relation 19474. Up to 3342 conditions per place. [2023-08-30 02:46:12,823 INFO L137 encePairwiseOnDemand]: 237/245 looper letters, 61 selfloop transitions, 13 changer transitions 2/82 dead transitions. [2023-08-30 02:46:12,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 82 transitions, 518 flow [2023-08-30 02:46:12,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:46:12,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:46:12,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 722 transitions. [2023-08-30 02:46:12,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4209912536443149 [2023-08-30 02:46:12,826 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 722 transitions. [2023-08-30 02:46:12,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 722 transitions. [2023-08-30 02:46:12,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:12,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 722 transitions. [2023-08-30 02:46:12,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.14285714285714) internal successors, (722), 7 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:12,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:12,831 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:12,831 INFO L175 Difference]: Start difference. First operand has 53 places, 36 transitions, 184 flow. Second operand 7 states and 722 transitions. [2023-08-30 02:46:12,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 82 transitions, 518 flow [2023-08-30 02:46:12,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 82 transitions, 518 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:46:12,848 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 299 flow [2023-08-30 02:46:12,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=299, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2023-08-30 02:46:12,849 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2023-08-30 02:46:12,849 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 299 flow [2023-08-30 02:46:12,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.71428571428571) internal successors, (670), 7 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-30 02:46:12,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:12,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:12,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:46:12,850 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:12,851 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:12,851 INFO L85 PathProgramCache]: Analyzing trace with hash -817612261, now seen corresponding path program 1 times [2023-08-30 02:46:12,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:46:12,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612965309] [2023-08-30 02:46:12,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:12,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:46:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:13,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:46:13,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:46:13,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612965309] [2023-08-30 02:46:13,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612965309] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:13,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:13,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:46:13,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367609121] [2023-08-30 02:46:13,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:13,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:46:13,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:46:13,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:46:13,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:46:13,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 245 [2023-08-30 02:46:13,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 299 flow. Second operand has 4 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-30 02:46:13,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:13,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 245 [2023-08-30 02:46:13,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:13,849 INFO L130 PetriNetUnfolder]: 4679/7528 cut-off events. [2023-08-30 02:46:13,849 INFO L131 PetriNetUnfolder]: For 12282/12495 co-relation queries the response was YES. [2023-08-30 02:46:13,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22609 conditions, 7528 events. 4679/7528 cut-off events. For 12282/12495 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 49856 event pairs, 1772 based on Foata normal form. 211/7638 useless extension candidates. Maximal degree in co-relation 22590. Up to 5043 conditions per place. [2023-08-30 02:46:13,903 INFO L137 encePairwiseOnDemand]: 240/245 looper letters, 59 selfloop transitions, 8 changer transitions 18/91 dead transitions. [2023-08-30 02:46:13,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 91 transitions, 632 flow [2023-08-30 02:46:13,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:46:13,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:46:13,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2023-08-30 02:46:13,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47836734693877553 [2023-08-30 02:46:13,906 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 586 transitions. [2023-08-30 02:46:13,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 586 transitions. [2023-08-30 02:46:13,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:13,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 586 transitions. [2023-08-30 02:46:13,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:13,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:13,910 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:13,910 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 299 flow. Second operand 5 states and 586 transitions. [2023-08-30 02:46:13,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 91 transitions, 632 flow [2023-08-30 02:46:13,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 91 transitions, 632 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:46:13,931 INFO L231 Difference]: Finished difference. Result has 71 places, 49 transitions, 331 flow [2023-08-30 02:46:13,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=331, PETRI_PLACES=71, PETRI_TRANSITIONS=49} [2023-08-30 02:46:13,932 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 27 predicate places. [2023-08-30 02:46:13,932 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 49 transitions, 331 flow [2023-08-30 02:46:13,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-30 02:46:13,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:13,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:13,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:46:13,933 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:13,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:13,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1388075401, now seen corresponding path program 2 times [2023-08-30 02:46:13,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:46:13,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025678688] [2023-08-30 02:46:13,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:13,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:46:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:14,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:46:14,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:46:14,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025678688] [2023-08-30 02:46:14,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025678688] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:14,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:14,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:46:14,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997593702] [2023-08-30 02:46:14,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:14,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:46:14,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:46:14,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:46:14,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:46:14,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 245 [2023-08-30 02:46:14,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 49 transitions, 331 flow. Second operand has 7 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:14,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:14,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 245 [2023-08-30 02:46:14,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:15,699 INFO L130 PetriNetUnfolder]: 5109/7986 cut-off events. [2023-08-30 02:46:15,699 INFO L131 PetriNetUnfolder]: For 21499/21711 co-relation queries the response was YES. [2023-08-30 02:46:15,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25306 conditions, 7986 events. 5109/7986 cut-off events. For 21499/21711 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 51242 event pairs, 3131 based on Foata normal form. 159/8003 useless extension candidates. Maximal degree in co-relation 25283. Up to 4965 conditions per place. [2023-08-30 02:46:15,742 INFO L137 encePairwiseOnDemand]: 237/245 looper letters, 67 selfloop transitions, 13 changer transitions 2/88 dead transitions. [2023-08-30 02:46:15,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 88 transitions, 710 flow [2023-08-30 02:46:15,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:46:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:46:15,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 733 transitions. [2023-08-30 02:46:15,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4274052478134111 [2023-08-30 02:46:15,745 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 733 transitions. [2023-08-30 02:46:15,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 733 transitions. [2023-08-30 02:46:15,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:15,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 733 transitions. [2023-08-30 02:46:15,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:15,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:15,750 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:15,750 INFO L175 Difference]: Start difference. First operand has 71 places, 49 transitions, 331 flow. Second operand 7 states and 733 transitions. [2023-08-30 02:46:15,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 88 transitions, 710 flow [2023-08-30 02:46:15,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 88 transitions, 659 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-08-30 02:46:15,794 INFO L231 Difference]: Finished difference. Result has 75 places, 59 transitions, 423 flow [2023-08-30 02:46:15,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=423, PETRI_PLACES=75, PETRI_TRANSITIONS=59} [2023-08-30 02:46:15,796 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 31 predicate places. [2023-08-30 02:46:15,797 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 423 flow [2023-08-30 02:46:15,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:15,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:15,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:15,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:46:15,798 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:15,805 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:15,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1329390628, now seen corresponding path program 1 times [2023-08-30 02:46:15,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:46:15,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340809949] [2023-08-30 02:46:15,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:15,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:46:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:16,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:46:16,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:46:16,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340809949] [2023-08-30 02:46:16,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340809949] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:16,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:16,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:46:16,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804138197] [2023-08-30 02:46:16,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:16,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:46:16,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:46:16,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:46:16,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:46:16,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 245 [2023-08-30 02:46:16,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 59 transitions, 423 flow. Second operand has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:16,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:16,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 245 [2023-08-30 02:46:16,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:17,061 INFO L130 PetriNetUnfolder]: 5612/8807 cut-off events. [2023-08-30 02:46:17,061 INFO L131 PetriNetUnfolder]: For 20639/20887 co-relation queries the response was YES. [2023-08-30 02:46:17,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28731 conditions, 8807 events. 5612/8807 cut-off events. For 20639/20887 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 57475 event pairs, 3659 based on Foata normal form. 122/8750 useless extension candidates. Maximal degree in co-relation 28707. Up to 7345 conditions per place. [2023-08-30 02:46:17,116 INFO L137 encePairwiseOnDemand]: 239/245 looper letters, 60 selfloop transitions, 17 changer transitions 1/84 dead transitions. [2023-08-30 02:46:17,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 84 transitions, 692 flow [2023-08-30 02:46:17,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:46:17,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:46:17,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 638 transitions. [2023-08-30 02:46:17,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4340136054421769 [2023-08-30 02:46:17,119 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 638 transitions. [2023-08-30 02:46:17,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 638 transitions. [2023-08-30 02:46:17,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:17,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 638 transitions. [2023-08-30 02:46:17,121 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-30 02:46:17,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:17,124 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:17,124 INFO L175 Difference]: Start difference. First operand has 75 places, 59 transitions, 423 flow. Second operand 6 states and 638 transitions. [2023-08-30 02:46:17,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 84 transitions, 692 flow [2023-08-30 02:46:17,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 84 transitions, 663 flow, removed 13 selfloop flow, removed 1 redundant places. [2023-08-30 02:46:17,154 INFO L231 Difference]: Finished difference. Result has 81 places, 60 transitions, 456 flow [2023-08-30 02:46:17,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=456, PETRI_PLACES=81, PETRI_TRANSITIONS=60} [2023-08-30 02:46:17,155 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2023-08-30 02:46:17,155 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 60 transitions, 456 flow [2023-08-30 02:46:17,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:17,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:17,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:17,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:46:17,156 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:17,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:17,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1704753039, now seen corresponding path program 1 times [2023-08-30 02:46:17,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:46:17,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046994539] [2023-08-30 02:46:17,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:17,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:46:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:17,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:46:17,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:46:17,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046994539] [2023-08-30 02:46:17,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046994539] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:17,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:17,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:46:17,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17903132] [2023-08-30 02:46:17,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:17,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:46:17,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:46:17,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:46:17,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:46:17,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 245 [2023-08-30 02:46:17,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 60 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:17,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:17,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 245 [2023-08-30 02:46:17,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:17,854 INFO L130 PetriNetUnfolder]: 2937/5052 cut-off events. [2023-08-30 02:46:17,854 INFO L131 PetriNetUnfolder]: For 10499/10641 co-relation queries the response was YES. [2023-08-30 02:46:17,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16469 conditions, 5052 events. 2937/5052 cut-off events. For 10499/10641 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 34201 event pairs, 641 based on Foata normal form. 218/5193 useless extension candidates. Maximal degree in co-relation 16442. Up to 4204 conditions per place. [2023-08-30 02:46:17,881 INFO L137 encePairwiseOnDemand]: 240/245 looper letters, 70 selfloop transitions, 4 changer transitions 0/80 dead transitions. [2023-08-30 02:46:17,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 80 transitions, 720 flow [2023-08-30 02:46:17,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:46:17,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:46:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-30 02:46:17,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4925170068027211 [2023-08-30 02:46:17,883 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-30 02:46:17,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-30 02:46:17,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:17,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-30 02:46:17,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:17,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:17,886 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:17,886 INFO L175 Difference]: Start difference. First operand has 81 places, 60 transitions, 456 flow. Second operand 3 states and 362 transitions. [2023-08-30 02:46:17,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 80 transitions, 720 flow [2023-08-30 02:46:17,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 80 transitions, 678 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-08-30 02:46:17,900 INFO L231 Difference]: Finished difference. Result has 78 places, 63 transitions, 441 flow [2023-08-30 02:46:17,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=78, PETRI_TRANSITIONS=63} [2023-08-30 02:46:17,901 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 34 predicate places. [2023-08-30 02:46:17,901 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 63 transitions, 441 flow [2023-08-30 02:46:17,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:17,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:17,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:17,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:46:17,902 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:17,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:17,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1873819850, now seen corresponding path program 1 times [2023-08-30 02:46:17,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:46:17,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234751628] [2023-08-30 02:46:17,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:17,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:46:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:46:18,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:46:18,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234751628] [2023-08-30 02:46:18,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234751628] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:18,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:18,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:46:18,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307043363] [2023-08-30 02:46:18,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:18,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:46:18,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:46:18,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:46:18,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:46:18,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 245 [2023-08-30 02:46:18,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 63 transitions, 441 flow. Second operand has 7 states, 7 states have (on average 97.0) internal successors, (679), 7 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:18,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:18,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 245 [2023-08-30 02:46:18,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:19,003 INFO L130 PetriNetUnfolder]: 2854/4941 cut-off events. [2023-08-30 02:46:19,003 INFO L131 PetriNetUnfolder]: For 9519/9647 co-relation queries the response was YES. [2023-08-30 02:46:19,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17478 conditions, 4941 events. 2854/4941 cut-off events. For 9519/9647 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 33524 event pairs, 1372 based on Foata normal form. 64/4929 useless extension candidates. Maximal degree in co-relation 17453. Up to 4614 conditions per place. [2023-08-30 02:46:19,025 INFO L137 encePairwiseOnDemand]: 239/245 looper letters, 48 selfloop transitions, 15 changer transitions 2/70 dead transitions. [2023-08-30 02:46:19,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 70 transitions, 590 flow [2023-08-30 02:46:19,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:46:19,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:46:19,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 604 transitions. [2023-08-30 02:46:19,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4108843537414966 [2023-08-30 02:46:19,031 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 604 transitions. [2023-08-30 02:46:19,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 604 transitions. [2023-08-30 02:46:19,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:19,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 604 transitions. [2023-08-30 02:46:19,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:19,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:19,035 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:19,035 INFO L175 Difference]: Start difference. First operand has 78 places, 63 transitions, 441 flow. Second operand 6 states and 604 transitions. [2023-08-30 02:46:19,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 70 transitions, 590 flow [2023-08-30 02:46:19,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 70 transitions, 570 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:46:19,046 INFO L231 Difference]: Finished difference. Result has 76 places, 59 transitions, 408 flow [2023-08-30 02:46:19,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=408, PETRI_PLACES=76, PETRI_TRANSITIONS=59} [2023-08-30 02:46:19,047 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 32 predicate places. [2023-08-30 02:46:19,047 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 59 transitions, 408 flow [2023-08-30 02:46:19,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.0) internal successors, (679), 7 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:19,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:19,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:19,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 02:46:19,048 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:19,049 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:19,049 INFO L85 PathProgramCache]: Analyzing trace with hash -462013346, now seen corresponding path program 1 times [2023-08-30 02:46:19,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:46:19,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132343044] [2023-08-30 02:46:19,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:19,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:46:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:19,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:46:19,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:46:19,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132343044] [2023-08-30 02:46:19,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132343044] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:19,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:19,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:46:19,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871499744] [2023-08-30 02:46:19,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:19,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:46:19,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:46:19,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:46:19,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:46:19,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 245 [2023-08-30 02:46:19,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 59 transitions, 408 flow. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:19,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:19,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 245 [2023-08-30 02:46:19,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:19,517 INFO L130 PetriNetUnfolder]: 1130/2180 cut-off events. [2023-08-30 02:46:19,517 INFO L131 PetriNetUnfolder]: For 3573/3611 co-relation queries the response was YES. [2023-08-30 02:46:19,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7623 conditions, 2180 events. 1130/2180 cut-off events. For 3573/3611 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 13874 event pairs, 239 based on Foata normal form. 225/2388 useless extension candidates. Maximal degree in co-relation 7600. Up to 793 conditions per place. [2023-08-30 02:46:19,532 INFO L137 encePairwiseOnDemand]: 240/245 looper letters, 80 selfloop transitions, 7 changer transitions 0/92 dead transitions. [2023-08-30 02:46:19,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 92 transitions, 791 flow [2023-08-30 02:46:19,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:46:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:46:19,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-08-30 02:46:19,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49183673469387756 [2023-08-30 02:46:19,535 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-08-30 02:46:19,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-08-30 02:46:19,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:19,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-08-30 02:46:19,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:19,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:19,538 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:19,538 INFO L175 Difference]: Start difference. First operand has 76 places, 59 transitions, 408 flow. Second operand 4 states and 482 transitions. [2023-08-30 02:46:19,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 92 transitions, 791 flow [2023-08-30 02:46:19,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 92 transitions, 753 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-08-30 02:46:19,545 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 418 flow [2023-08-30 02:46:19,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=418, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2023-08-30 02:46:19,546 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 27 predicate places. [2023-08-30 02:46:19,547 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 418 flow [2023-08-30 02:46:19,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:19,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:19,547 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] [2023-08-30 02:46:19,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 02:46:19,547 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:19,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:19,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1046486906, now seen corresponding path program 1 times [2023-08-30 02:46:19,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:46:19,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630643942] [2023-08-30 02:46:19,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:19,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:46:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:46:20,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:46:20,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630643942] [2023-08-30 02:46:20,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630643942] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:20,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:20,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:46:20,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797907772] [2023-08-30 02:46:20,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:20,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:46:20,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:46:20,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:46:20,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:46:20,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 245 [2023-08-30 02:46:20,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 418 flow. Second operand has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:20,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:20,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 245 [2023-08-30 02:46:20,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:21,013 INFO L130 PetriNetUnfolder]: 2481/4678 cut-off events. [2023-08-30 02:46:21,013 INFO L131 PetriNetUnfolder]: For 8754/8754 co-relation queries the response was YES. [2023-08-30 02:46:21,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17583 conditions, 4678 events. 2481/4678 cut-off events. For 8754/8754 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 31864 event pairs, 684 based on Foata normal form. 71/4749 useless extension candidates. Maximal degree in co-relation 17562. Up to 1551 conditions per place. [2023-08-30 02:46:21,036 INFO L137 encePairwiseOnDemand]: 234/245 looper letters, 118 selfloop transitions, 29 changer transitions 18/165 dead transitions. [2023-08-30 02:46:21,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 165 transitions, 1330 flow [2023-08-30 02:46:21,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 02:46:21,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 02:46:21,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1060 transitions. [2023-08-30 02:46:21,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4326530612244898 [2023-08-30 02:46:21,041 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1060 transitions. [2023-08-30 02:46:21,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1060 transitions. [2023-08-30 02:46:21,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:21,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1060 transitions. [2023-08-30 02:46:21,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:21,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 245.0) internal successors, (2695), 11 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:21,048 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 245.0) internal successors, (2695), 11 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:21,048 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 418 flow. Second operand 10 states and 1060 transitions. [2023-08-30 02:46:21,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 165 transitions, 1330 flow [2023-08-30 02:46:21,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 165 transitions, 1276 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-08-30 02:46:21,061 INFO L231 Difference]: Finished difference. Result has 83 places, 73 transitions, 577 flow [2023-08-30 02:46:21,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=577, PETRI_PLACES=83, PETRI_TRANSITIONS=73} [2023-08-30 02:46:21,061 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 39 predicate places. [2023-08-30 02:46:21,062 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 73 transitions, 577 flow [2023-08-30 02:46:21,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:21,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:21,062 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] [2023-08-30 02:46:21,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 02:46:21,063 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:21,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:21,063 INFO L85 PathProgramCache]: Analyzing trace with hash 183537496, now seen corresponding path program 2 times [2023-08-30 02:46:21,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:46:21,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263237052] [2023-08-30 02:46:21,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:21,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:46:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:21,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:46:21,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:46:21,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263237052] [2023-08-30 02:46:21,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263237052] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:21,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:21,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:46:21,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122476130] [2023-08-30 02:46:21,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:21,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:46:21,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:46:21,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:46:21,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:46:21,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 245 [2023-08-30 02:46:21,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 73 transitions, 577 flow. Second operand has 5 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-30 02:46:21,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:21,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 245 [2023-08-30 02:46:21,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:21,849 INFO L130 PetriNetUnfolder]: 1236/2474 cut-off events. [2023-08-30 02:46:21,849 INFO L131 PetriNetUnfolder]: For 7256/7308 co-relation queries the response was YES. [2023-08-30 02:46:21,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9968 conditions, 2474 events. 1236/2474 cut-off events. For 7256/7308 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 17218 event pairs, 266 based on Foata normal form. 166/2623 useless extension candidates. Maximal degree in co-relation 9942. Up to 1011 conditions per place. [2023-08-30 02:46:21,866 INFO L137 encePairwiseOnDemand]: 240/245 looper letters, 89 selfloop transitions, 10 changer transitions 2/109 dead transitions. [2023-08-30 02:46:21,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 109 transitions, 1061 flow [2023-08-30 02:46:21,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:46:21,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:46:21,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2023-08-30 02:46:21,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4816326530612245 [2023-08-30 02:46:21,869 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 590 transitions. [2023-08-30 02:46:21,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 590 transitions. [2023-08-30 02:46:21,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:21,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 590 transitions. [2023-08-30 02:46:21,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:21,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:21,873 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:21,873 INFO L175 Difference]: Start difference. First operand has 83 places, 73 transitions, 577 flow. Second operand 5 states and 590 transitions. [2023-08-30 02:46:21,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 109 transitions, 1061 flow [2023-08-30 02:46:21,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 109 transitions, 999 flow, removed 16 selfloop flow, removed 6 redundant places. [2023-08-30 02:46:21,889 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 551 flow [2023-08-30 02:46:21,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=551, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2023-08-30 02:46:21,890 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 36 predicate places. [2023-08-30 02:46:21,890 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 72 transitions, 551 flow [2023-08-30 02:46:21,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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-30 02:46:21,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:21,891 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, 1, 1] [2023-08-30 02:46:21,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 02:46:21,891 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:21,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:21,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1274390802, now seen corresponding path program 1 times [2023-08-30 02:46:21,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:46:21,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045143411] [2023-08-30 02:46:21,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:21,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:46:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:22,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:46:22,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:46:22,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045143411] [2023-08-30 02:46:22,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045143411] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:22,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:22,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:46:22,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69006863] [2023-08-30 02:46:22,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:22,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:46:22,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:46:22,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:46:22,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:46:22,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 245 [2023-08-30 02:46:22,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 551 flow. Second operand has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:22,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:22,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 245 [2023-08-30 02:46:22,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:22,760 INFO L130 PetriNetUnfolder]: 2665/4933 cut-off events. [2023-08-30 02:46:22,760 INFO L131 PetriNetUnfolder]: For 15071/15071 co-relation queries the response was YES. [2023-08-30 02:46:22,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20820 conditions, 4933 events. 2665/4933 cut-off events. For 15071/15071 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 34758 event pairs, 616 based on Foata normal form. 12/4945 useless extension candidates. Maximal degree in co-relation 20797. Up to 2575 conditions per place. [2023-08-30 02:46:22,777 INFO L137 encePairwiseOnDemand]: 237/245 looper letters, 84 selfloop transitions, 7 changer transitions 65/156 dead transitions. [2023-08-30 02:46:22,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 156 transitions, 1496 flow [2023-08-30 02:46:22,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:46:22,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:46:22,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 747 transitions. [2023-08-30 02:46:22,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43556851311953354 [2023-08-30 02:46:22,783 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 747 transitions. [2023-08-30 02:46:22,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 747 transitions. [2023-08-30 02:46:22,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:22,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 747 transitions. [2023-08-30 02:46:22,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.71428571428571) internal successors, (747), 7 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:22,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:22,788 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:22,789 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 551 flow. Second operand 7 states and 747 transitions. [2023-08-30 02:46:22,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 156 transitions, 1496 flow [2023-08-30 02:46:22,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 156 transitions, 1426 flow, removed 19 selfloop flow, removed 4 redundant places. [2023-08-30 02:46:22,851 INFO L231 Difference]: Finished difference. Result has 85 places, 66 transitions, 494 flow [2023-08-30 02:46:22,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=494, PETRI_PLACES=85, PETRI_TRANSITIONS=66} [2023-08-30 02:46:22,852 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 41 predicate places. [2023-08-30 02:46:22,852 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 66 transitions, 494 flow [2023-08-30 02:46:22,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:22,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:22,853 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, 1, 1] [2023-08-30 02:46:22,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 02:46:22,853 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:22,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:22,854 INFO L85 PathProgramCache]: Analyzing trace with hash 942524526, now seen corresponding path program 2 times [2023-08-30 02:46:22,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:46:22,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201731761] [2023-08-30 02:46:22,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:22,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:46:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:46:23,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:46:23,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201731761] [2023-08-30 02:46:23,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201731761] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:23,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:23,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:46:23,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788841089] [2023-08-30 02:46:23,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:23,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:46:23,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:46:23,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:46:23,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:46:23,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 245 [2023-08-30 02:46:23,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 66 transitions, 494 flow. Second operand has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:23,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:23,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 245 [2023-08-30 02:46:23,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:23,506 INFO L130 PetriNetUnfolder]: 1553/3271 cut-off events. [2023-08-30 02:46:23,506 INFO L131 PetriNetUnfolder]: For 8135/8135 co-relation queries the response was YES. [2023-08-30 02:46:23,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12816 conditions, 3271 events. 1553/3271 cut-off events. For 8135/8135 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 24382 event pairs, 422 based on Foata normal form. 10/3259 useless extension candidates. Maximal degree in co-relation 12791. Up to 1360 conditions per place. [2023-08-30 02:46:23,518 INFO L137 encePairwiseOnDemand]: 241/245 looper letters, 59 selfloop transitions, 1 changer transitions 53/115 dead transitions. [2023-08-30 02:46:23,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 115 transitions, 1062 flow [2023-08-30 02:46:23,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:46:23,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:46:23,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 563 transitions. [2023-08-30 02:46:23,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595918367346939 [2023-08-30 02:46:23,520 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 563 transitions. [2023-08-30 02:46:23,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 563 transitions. [2023-08-30 02:46:23,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:23,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 563 transitions. [2023-08-30 02:46:23,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:23,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:23,524 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:23,524 INFO L175 Difference]: Start difference. First operand has 85 places, 66 transitions, 494 flow. Second operand 5 states and 563 transitions. [2023-08-30 02:46:23,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 115 transitions, 1062 flow [2023-08-30 02:46:23,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 115 transitions, 1043 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-30 02:46:23,565 INFO L231 Difference]: Finished difference. Result has 86 places, 53 transitions, 386 flow [2023-08-30 02:46:23,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=386, PETRI_PLACES=86, PETRI_TRANSITIONS=53} [2023-08-30 02:46:23,566 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 42 predicate places. [2023-08-30 02:46:23,566 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 53 transitions, 386 flow [2023-08-30 02:46:23,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:23,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:23,566 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, 1, 1] [2023-08-30 02:46:23,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 02:46:23,567 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:23,567 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:23,567 INFO L85 PathProgramCache]: Analyzing trace with hash 186909204, now seen corresponding path program 3 times [2023-08-30 02:46:23,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:46:23,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523916943] [2023-08-30 02:46:23,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:23,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:46:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:24,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:46:24,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:46:24,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523916943] [2023-08-30 02:46:24,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523916943] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:24,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:24,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:46:24,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902971774] [2023-08-30 02:46:24,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:24,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:46:24,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:46:24,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:46:24,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:46:24,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 245 [2023-08-30 02:46:24,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 53 transitions, 386 flow. Second operand has 8 states, 8 states have (on average 105.625) internal successors, (845), 8 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:24,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:24,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 245 [2023-08-30 02:46:24,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:24,816 INFO L130 PetriNetUnfolder]: 529/1235 cut-off events. [2023-08-30 02:46:24,816 INFO L131 PetriNetUnfolder]: For 3015/3046 co-relation queries the response was YES. [2023-08-30 02:46:24,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4847 conditions, 1235 events. 529/1235 cut-off events. For 3015/3046 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7869 event pairs, 88 based on Foata normal form. 24/1231 useless extension candidates. Maximal degree in co-relation 4820. Up to 449 conditions per place. [2023-08-30 02:46:24,822 INFO L137 encePairwiseOnDemand]: 237/245 looper letters, 57 selfloop transitions, 17 changer transitions 21/98 dead transitions. [2023-08-30 02:46:24,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 98 transitions, 807 flow [2023-08-30 02:46:24,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 02:46:24,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 02:46:24,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 985 transitions. [2023-08-30 02:46:24,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4467120181405896 [2023-08-30 02:46:24,825 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 985 transitions. [2023-08-30 02:46:24,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 985 transitions. [2023-08-30 02:46:24,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:24,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 985 transitions. [2023-08-30 02:46:24,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 109.44444444444444) internal successors, (985), 9 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:24,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 245.0) internal successors, (2450), 10 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:24,831 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 245.0) internal successors, (2450), 10 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:24,832 INFO L175 Difference]: Start difference. First operand has 86 places, 53 transitions, 386 flow. Second operand 9 states and 985 transitions. [2023-08-30 02:46:24,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 98 transitions, 807 flow [2023-08-30 02:46:24,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 98 transitions, 769 flow, removed 8 selfloop flow, removed 8 redundant places. [2023-08-30 02:46:24,842 INFO L231 Difference]: Finished difference. Result has 86 places, 54 transitions, 412 flow [2023-08-30 02:46:24,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=412, PETRI_PLACES=86, PETRI_TRANSITIONS=54} [2023-08-30 02:46:24,843 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 42 predicate places. [2023-08-30 02:46:24,843 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 54 transitions, 412 flow [2023-08-30 02:46:24,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 105.625) internal successors, (845), 8 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:24,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:24,844 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, 1, 1] [2023-08-30 02:46:24,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 02:46:24,844 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:24,844 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:24,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1054581158, now seen corresponding path program 4 times [2023-08-30 02:46:24,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:46:24,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523586697] [2023-08-30 02:46:24,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:24,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:46:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:46:24,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:46:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:46:24,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:46:24,968 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:46:24,969 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-30 02:46:24,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-30 02:46:24,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-30 02:46:24,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-30 02:46:24,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-30 02:46:24,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-30 02:46:24,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-30 02:46:24,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-30 02:46:24,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-30 02:46:24,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-30 02:46:24,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-30 02:46:24,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-30 02:46:24,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-30 02:46:24,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 02:46:24,975 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:24,980 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:46:24,981 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:46:25,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:46:25 BasicIcfg [2023-08-30 02:46:25,082 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:46:25,082 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:46:25,082 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:46:25,083 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:46:25,084 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:46:02" (3/4) ... [2023-08-30 02:46:25,087 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:46:25,087 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:46:25,087 INFO L158 Benchmark]: Toolchain (without parser) took 24351.79ms. Allocated memory was 62.9MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 39.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 121.5MB. Max. memory is 16.1GB. [2023-08-30 02:46:25,088 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 52.4MB. Free memory was 30.2MB in the beginning and 30.1MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:46:25,088 INFO L158 Benchmark]: CACSL2BoogieTranslator took 592.02ms. Allocated memory is still 62.9MB. Free memory was 39.2MB in the beginning and 30.9MB in the end (delta: 8.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-08-30 02:46:25,088 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.58ms. Allocated memory is still 62.9MB. Free memory was 30.9MB in the beginning and 28.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:46:25,089 INFO L158 Benchmark]: Boogie Preprocessor took 29.15ms. Allocated memory is still 62.9MB. Free memory was 28.4MB in the beginning and 26.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:46:25,089 INFO L158 Benchmark]: RCFGBuilder took 709.61ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 26.4MB in the beginning and 33.0MB in the end (delta: -6.6MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2023-08-30 02:46:25,089 INFO L158 Benchmark]: TraceAbstraction took 22967.29ms. Allocated memory was 75.5MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 32.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 100.5MB. Max. memory is 16.1GB. [2023-08-30 02:46:25,089 INFO L158 Benchmark]: Witness Printer took 4.37ms. Allocated memory is still 1.6GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:46:25,092 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.20ms. Allocated memory is still 52.4MB. Free memory was 30.2MB in the beginning and 30.1MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 592.02ms. Allocated memory is still 62.9MB. Free memory was 39.2MB in the beginning and 30.9MB in the end (delta: 8.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.58ms. Allocated memory is still 62.9MB. Free memory was 30.9MB in the beginning and 28.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.15ms. Allocated memory is still 62.9MB. Free memory was 28.4MB in the beginning and 26.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 709.61ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 26.4MB in the beginning and 33.0MB in the end (delta: -6.6MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * TraceAbstraction took 22967.29ms. Allocated memory was 75.5MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 32.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 100.5MB. Max. memory is 16.1GB. * Witness Printer took 4.37ms. Allocated memory is still 1.6GB. Free memory was 1.5GB in the beginning and 1.5GB 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: 4.0s, 130 PlacesBefore, 44 PlacesAfterwards, 122 TransitionsBefore, 35 TransitionsAfterwards, 2498 CoEnabledTransitionPairs, 6 FixpointIterations, 53 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 120 TotalNumberOfCompositions, 6987 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3705, independent: 3514, independent conditional: 0, independent unconditional: 3514, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1387, independent: 1348, independent conditional: 0, independent unconditional: 1348, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3705, independent: 2166, independent conditional: 0, independent unconditional: 2166, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 1387, unknown conditional: 0, unknown unconditional: 1387] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 158, Positive conditional cache size: 0, Positive unconditional cache size: 158, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 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_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool a$flush_delayed; [L723] 0 int a$mem_tmp; [L724] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$read_delayed; [L733] 0 int *a$read_delayed_var; [L734] 0 int a$w_buff0; [L735] 0 _Bool a$w_buff0_used; [L736] 0 int a$w_buff1; [L737] 0 _Bool a$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L850] 0 pthread_t t385; [L851] FCALL, FORK 0 pthread_create(&t385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t385, ((void *)0), P0, ((void *)0))=-2, t385={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t386; [L853] FCALL, FORK 0 pthread_create(&t386, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t386, ((void *)0), P1, ((void *)0))=-1, t385={5:0}, t386={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 [L766] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=0, z=0] [L769] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L854] 0 pthread_t t387; [L855] FCALL, FORK 0 pthread_create(&t387, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t387, ((void *)0), P2, ((void *)0))=0, t385={5:0}, t386={6:0}, t387={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L789] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L809] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 a$flush_delayed = weak$$choice2 [L815] 3 a$mem_tmp = a [L816] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L817] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L818] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L819] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L820] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L822] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EBX = a [L824] 3 a = a$flush_delayed ? a$mem_tmp : a [L825] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L828] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L830] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L832] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t385={5:0}, t386={6:0}, t387={3:0}, weak$$choice2=0, x=1, y=1, z=1] [L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] 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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 848]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 855]: 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: 851]: 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, 155 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: 22.8s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1249 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 925 mSDsluCounter, 646 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 523 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3700 IncrementalHoareTripleChecker+Invalid, 3840 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 123 mSDtfsCounter, 3700 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=577occurred in iteration=13, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 2949 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 02:46:25,111 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/mix015.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 951d1f5e5395236f7d0da1ed6dd6f4a1398d1a8ad75d935345731aeb4389e0e8 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:46:27,104 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:46:27,106 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:46:27,135 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:46:27,136 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:46:27,137 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:46:27,138 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:46:27,140 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:46:27,141 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:46:27,142 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:46:27,143 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:46:27,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:46:27,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:46:27,145 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:46:27,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:46:27,147 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:46:27,148 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:46:27,149 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:46:27,150 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:46:27,152 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:46:27,161 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:46:27,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:46:27,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:46:27,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:46:27,168 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:46:27,168 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:46:27,169 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:46:27,170 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:46:27,170 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:46:27,171 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:46:27,171 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:46:27,172 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:46:27,173 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:46:27,173 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:46:27,174 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:46:27,174 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:46:27,175 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:46:27,175 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:46:27,176 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:46:27,176 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:46:27,177 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:46:27,178 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 02:46:27,198 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:46:27,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:46:27,199 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:46:27,199 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:46:27,200 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:46:27,200 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:46:27,201 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:46:27,201 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:46:27,201 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:46:27,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:46:27,201 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:46:27,202 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:46:27,202 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:46:27,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:46:27,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:46:27,202 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:46:27,203 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:46:27,203 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:46:27,203 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:46:27,203 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:46:27,203 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 02:46:27,203 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 02:46:27,204 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:46:27,204 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:46:27,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:46:27,204 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:46:27,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:46:27,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:46:27,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:46:27,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:46:27,205 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 02:46:27,205 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 02:46:27,206 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:46:27,206 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:46:27,206 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:46:27,206 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 02:46:27,206 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:46:27,207 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 -> 951d1f5e5395236f7d0da1ed6dd6f4a1398d1a8ad75d935345731aeb4389e0e8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 02:46:27,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:46:27,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:46:27,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:46:27,506 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:46:27,506 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:46:27,508 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015.oepc.i [2023-08-30 02:46:28,745 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:46:28,999 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:46:28,999 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015.oepc.i [2023-08-30 02:46:29,013 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7aabc257/4048c62777274a6ca881e385bca96b37/FLAG829e85c81 [2023-08-30 02:46:29,027 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7aabc257/4048c62777274a6ca881e385bca96b37 [2023-08-30 02:46:29,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:46:29,035 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:46:29,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:46:29,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:46:29,040 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:46:29,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:46:29" (1/1) ... [2023-08-30 02:46:29,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@151755c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:29, skipping insertion in model container [2023-08-30 02:46:29,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:46:29" (1/1) ... [2023-08-30 02:46:29,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:46:29,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:46:29,219 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/mix015.oepc.i[945,958] [2023-08-30 02:46:29,454 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:46:29,478 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:46:29,491 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/mix015.oepc.i[945,958] [2023-08-30 02:46:29,560 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:46:29,598 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:46:29,598 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:46:29,603 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:46:29,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:29 WrapperNode [2023-08-30 02:46:29,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:46:29,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:46:29,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:46:29,605 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:46:29,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:29" (1/1) ... [2023-08-30 02:46:29,645 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:29" (1/1) ... [2023-08-30 02:46:29,683 INFO L138 Inliner]: procedures = 179, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2023-08-30 02:46:29,684 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:46:29,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:46:29,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:46:29,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:46:29,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:29" (1/1) ... [2023-08-30 02:46:29,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:29" (1/1) ... [2023-08-30 02:46:29,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:29" (1/1) ... [2023-08-30 02:46:29,706 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:29" (1/1) ... [2023-08-30 02:46:29,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:29" (1/1) ... [2023-08-30 02:46:29,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:29" (1/1) ... [2023-08-30 02:46:29,736 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:29" (1/1) ... [2023-08-30 02:46:29,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:29" (1/1) ... [2023-08-30 02:46:29,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:46:29,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:46:29,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:46:29,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:46:29,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:29" (1/1) ... [2023-08-30 02:46:29,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:46:29,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:46:29,779 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 02:46:29,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 02:46:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:46:29,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:46:29,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:46:29,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:46:29,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 02:46:29,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 02:46:29,823 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:46:29,823 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:46:29,823 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:46:29,824 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:46:29,824 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:46:29,824 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:46:29,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:46:29,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:46:29,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:46:29,825 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:46:30,001 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:46:30,003 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:46:30,321 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:46:30,444 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:46:30,445 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:46:30,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:46:30 BoogieIcfgContainer [2023-08-30 02:46:30,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:46:30,448 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:46:30,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:46:30,451 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:46:30,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:46:29" (1/3) ... [2023-08-30 02:46:30,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c2ed798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:46:30, skipping insertion in model container [2023-08-30 02:46:30,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:29" (2/3) ... [2023-08-30 02:46:30,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c2ed798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:46:30, skipping insertion in model container [2023-08-30 02:46:30,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:46:30" (3/3) ... [2023-08-30 02:46:30,453 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015.oepc.i [2023-08-30 02:46:30,469 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:46:30,469 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-30 02:46:30,469 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:46:30,522 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:46:30,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 126 transitions, 267 flow [2023-08-30 02:46:30,596 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2023-08-30 02:46:30,596 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:46:30,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-30 02:46:30,601 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 126 transitions, 267 flow [2023-08-30 02:46:30,605 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 123 transitions, 255 flow [2023-08-30 02:46:30,608 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:46:30,616 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 123 transitions, 255 flow [2023-08-30 02:46:30,619 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 123 transitions, 255 flow [2023-08-30 02:46:30,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 255 flow [2023-08-30 02:46:30,658 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2023-08-30 02:46:30,658 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:46:30,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-30 02:46:30,663 INFO L119 LiptonReduction]: Number of co-enabled transitions 2498 [2023-08-30 02:46:36,810 INFO L134 LiptonReduction]: Checked pairs total: 7536 [2023-08-30 02:46:36,811 INFO L136 LiptonReduction]: Total number of compositions: 118 [2023-08-30 02:46:36,824 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:46:36,829 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;@2469ff16, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:46:36,830 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-30 02:46:36,831 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:46:36,831 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:46:36,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:36,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:46:36,833 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:36,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:36,837 INFO L85 PathProgramCache]: Analyzing trace with hash 541, now seen corresponding path program 1 times [2023-08-30 02:46:36,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:46:36,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088686285] [2023-08-30 02:46:36,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:36,849 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:46:36,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:46:36,861 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:46:36,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-30 02:46:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:36,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 02:46:36,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:46:36,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:46:36,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:46:36,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:46:36,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1088686285] [2023-08-30 02:46:36,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1088686285] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:36,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:36,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:46:36,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335551578] [2023-08-30 02:46:36,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:36,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:46:36,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:46:36,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:46:36,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:46:36,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 244 [2023-08-30 02:46:36,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 79 flow. Second operand has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:36,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:36,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 244 [2023-08-30 02:46:36,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:37,573 INFO L130 PetriNetUnfolder]: 2255/3299 cut-off events. [2023-08-30 02:46:37,574 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-08-30 02:46:37,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6642 conditions, 3299 events. 2255/3299 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 16367 event pairs, 2255 based on Foata normal form. 120/2844 useless extension candidates. Maximal degree in co-relation 6631. Up to 3277 conditions per place. [2023-08-30 02:46:37,593 INFO L137 encePairwiseOnDemand]: 237/244 looper letters, 25 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2023-08-30 02:46:37,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 28 transitions, 115 flow [2023-08-30 02:46:37,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:46:37,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:46:37,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 258 transitions. [2023-08-30 02:46:37,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5286885245901639 [2023-08-30 02:46:37,606 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 258 transitions. [2023-08-30 02:46:37,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 258 transitions. [2023-08-30 02:46:37,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:37,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 258 transitions. [2023-08-30 02:46:37,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 129.0) internal successors, (258), 2 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:37,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:37,617 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:37,618 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 79 flow. Second operand 2 states and 258 transitions. [2023-08-30 02:46:37,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 28 transitions, 115 flow [2023-08-30 02:46:37,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 28 transitions, 112 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:46:37,623 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2023-08-30 02:46:37,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-08-30 02:46:37,627 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -8 predicate places. [2023-08-30 02:46:37,627 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 62 flow [2023-08-30 02:46:37,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:37,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:37,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:46:37,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-30 02:46:37,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:46:37,837 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:37,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:37,838 INFO L85 PathProgramCache]: Analyzing trace with hash 531490, now seen corresponding path program 1 times [2023-08-30 02:46:37,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:46:37,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450012764] [2023-08-30 02:46:37,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:37,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:46:37,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:46:37,842 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:46:37,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-30 02:46:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:37,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:46:37,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:46:37,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:46:37,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:46:37,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:46:37,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450012764] [2023-08-30 02:46:37,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450012764] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:37,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:37,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:46:37,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989013200] [2023-08-30 02:46:37,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:37,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:46:37,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:46:37,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:46:37,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:46:37,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 244 [2023-08-30 02:46:37,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:37,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:37,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 244 [2023-08-30 02:46:37,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:38,292 INFO L130 PetriNetUnfolder]: 1851/2744 cut-off events. [2023-08-30 02:46:38,293 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:46:38,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5501 conditions, 2744 events. 1851/2744 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 13333 event pairs, 823 based on Foata normal form. 0/2436 useless extension candidates. Maximal degree in co-relation 5498. Up to 2297 conditions per place. [2023-08-30 02:46:38,306 INFO L137 encePairwiseOnDemand]: 241/244 looper letters, 36 selfloop transitions, 2 changer transitions 4/45 dead transitions. [2023-08-30 02:46:38,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 45 transitions, 184 flow [2023-08-30 02:46:38,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:46:38,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:46:38,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-08-30 02:46:38,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51775956284153 [2023-08-30 02:46:38,313 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-08-30 02:46:38,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-08-30 02:46:38,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:38,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-08-30 02:46:38,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:38,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:38,320 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:38,321 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 62 flow. Second operand 3 states and 379 transitions. [2023-08-30 02:46:38,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 45 transitions, 184 flow [2023-08-30 02:46:38,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:46:38,322 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 60 flow [2023-08-30 02:46:38,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-08-30 02:46:38,323 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -7 predicate places. [2023-08-30 02:46:38,324 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 60 flow [2023-08-30 02:46:38,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:38,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:38,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:38,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-30 02:46:38,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:46:38,534 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:38,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:38,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1279706587, now seen corresponding path program 1 times [2023-08-30 02:46:38,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:46:38,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711082313] [2023-08-30 02:46:38,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:38,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:46:38,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:46:38,538 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:46:38,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-30 02:46:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:38,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:46:38,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:46:38,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:46:38,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:46:38,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:46:38,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711082313] [2023-08-30 02:46:38,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711082313] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:38,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:38,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:46:38,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451797863] [2023-08-30 02:46:38,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:38,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:46:38,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:46:38,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:46:38,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:46:38,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 244 [2023-08-30 02:46:38,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:38,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:38,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 244 [2023-08-30 02:46:38,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:38,826 INFO L130 PetriNetUnfolder]: 661/1091 cut-off events. [2023-08-30 02:46:38,826 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2023-08-30 02:46:38,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2290 conditions, 1091 events. 661/1091 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5095 event pairs, 163 based on Foata normal form. 48/1080 useless extension candidates. Maximal degree in co-relation 2286. Up to 895 conditions per place. [2023-08-30 02:46:38,832 INFO L137 encePairwiseOnDemand]: 239/244 looper letters, 33 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2023-08-30 02:46:38,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 40 transitions, 170 flow [2023-08-30 02:46:38,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:46:38,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:46:38,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-08-30 02:46:38,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49863387978142076 [2023-08-30 02:46:38,835 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-08-30 02:46:38,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-08-30 02:46:38,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:38,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-08-30 02:46:38,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:38,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:38,838 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:38,838 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 60 flow. Second operand 3 states and 365 transitions. [2023-08-30 02:46:38,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 40 transitions, 170 flow [2023-08-30 02:46:38,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 40 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:46:38,840 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 82 flow [2023-08-30 02:46:38,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-08-30 02:46:38,841 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -8 predicate places. [2023-08-30 02:46:38,841 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 82 flow [2023-08-30 02:46:38,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:38,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:38,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:38,851 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 (4)] Ended with exit code 0 [2023-08-30 02:46:39,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:46:39,052 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:39,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:39,053 INFO L85 PathProgramCache]: Analyzing trace with hash -632563434, now seen corresponding path program 1 times [2023-08-30 02:46:39,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:46:39,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1622864433] [2023-08-30 02:46:39,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:39,054 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:46:39,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:46:39,055 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:46:39,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-30 02:46:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:39,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:46:39,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:46:39,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:46:39,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:46:39,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:46:39,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1622864433] [2023-08-30 02:46:39,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1622864433] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:39,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:39,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:46:39,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117131601] [2023-08-30 02:46:39,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:39,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:46:39,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:46:39,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:46:39,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:46:39,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 244 [2023-08-30 02:46:39,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:39,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:39,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 244 [2023-08-30 02:46:39,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:39,377 INFO L130 PetriNetUnfolder]: 261/491 cut-off events. [2023-08-30 02:46:39,378 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2023-08-30 02:46:39,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1189 conditions, 491 events. 261/491 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2049 event pairs, 102 based on Foata normal form. 40/512 useless extension candidates. Maximal degree in co-relation 1184. Up to 178 conditions per place. [2023-08-30 02:46:39,381 INFO L137 encePairwiseOnDemand]: 239/244 looper letters, 43 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2023-08-30 02:46:39,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 53 transitions, 244 flow [2023-08-30 02:46:39,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:46:39,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:46:39,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2023-08-30 02:46:39,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4989754098360656 [2023-08-30 02:46:39,383 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2023-08-30 02:46:39,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2023-08-30 02:46:39,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:39,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2023-08-30 02:46:39,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:39,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:39,387 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:39,387 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 82 flow. Second operand 4 states and 487 transitions. [2023-08-30 02:46:39,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 53 transitions, 244 flow [2023-08-30 02:46:39,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 53 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:46:39,389 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 118 flow [2023-08-30 02:46:39,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2023-08-30 02:46:39,390 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -5 predicate places. [2023-08-30 02:46:39,390 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 118 flow [2023-08-30 02:46:39,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:39,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:39,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:39,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-30 02:46:39,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:46:39,601 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:39,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:39,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1865528873, now seen corresponding path program 1 times [2023-08-30 02:46:39,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:46:39,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328137193] [2023-08-30 02:46:39,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:39,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:46:39,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:46:39,604 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:46:39,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-30 02:46:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:39,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 02:46:39,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:46:39,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:46:39,757 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:46:39,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:46:39,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328137193] [2023-08-30 02:46:39,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328137193] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:39,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:39,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:46:39,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139460676] [2023-08-30 02:46:39,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:39,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:46:39,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:46:39,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:46:39,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:46:39,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 244 [2023-08-30 02:46:39,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:39,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:39,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 244 [2023-08-30 02:46:39,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:39,997 INFO L130 PetriNetUnfolder]: 206/381 cut-off events. [2023-08-30 02:46:39,997 INFO L131 PetriNetUnfolder]: For 279/279 co-relation queries the response was YES. [2023-08-30 02:46:39,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 381 events. 206/381 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1562 event pairs, 97 based on Foata normal form. 11/384 useless extension candidates. Maximal degree in co-relation 995. Up to 178 conditions per place. [2023-08-30 02:46:40,000 INFO L137 encePairwiseOnDemand]: 239/244 looper letters, 40 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2023-08-30 02:46:40,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 268 flow [2023-08-30 02:46:40,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:46:40,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:46:40,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 596 transitions. [2023-08-30 02:46:40,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4885245901639344 [2023-08-30 02:46:40,003 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 596 transitions. [2023-08-30 02:46:40,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 596 transitions. [2023-08-30 02:46:40,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:40,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 596 transitions. [2023-08-30 02:46:40,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:40,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:40,008 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:40,008 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 118 flow. Second operand 5 states and 596 transitions. [2023-08-30 02:46:40,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 268 flow [2023-08-30 02:46:40,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 254 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-30 02:46:40,011 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 132 flow [2023-08-30 02:46:40,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-08-30 02:46:40,012 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2023-08-30 02:46:40,013 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 132 flow [2023-08-30 02:46:40,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:40,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:40,013 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, 1, 1] [2023-08-30 02:46:40,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-30 02:46:40,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:46:40,224 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:40,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:40,225 INFO L85 PathProgramCache]: Analyzing trace with hash -776221173, now seen corresponding path program 1 times [2023-08-30 02:46:40,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:46:40,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700020464] [2023-08-30 02:46:40,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:40,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:46:40,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:46:40,227 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:46:40,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-30 02:46:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:40,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-30 02:46:40,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:46:40,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:46:40,637 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:46:40,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:46:40,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700020464] [2023-08-30 02:46:40,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700020464] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:40,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:40,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:46:40,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764077642] [2023-08-30 02:46:40,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:40,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:46:40,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:46:40,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:46:40,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:46:40,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 244 [2023-08-30 02:46:40,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 132 flow. Second operand has 8 states, 8 states have (on average 106.625) internal successors, (853), 8 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:40,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:40,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 244 [2023-08-30 02:46:40,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:41,000 INFO L130 PetriNetUnfolder]: 228/426 cut-off events. [2023-08-30 02:46:41,001 INFO L131 PetriNetUnfolder]: For 387/387 co-relation queries the response was YES. [2023-08-30 02:46:41,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 426 events. 228/426 cut-off events. For 387/387 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1707 event pairs, 47 based on Foata normal form. 0/423 useless extension candidates. Maximal degree in co-relation 1199. Up to 154 conditions per place. [2023-08-30 02:46:41,003 INFO L137 encePairwiseOnDemand]: 237/244 looper letters, 63 selfloop transitions, 7 changer transitions 0/73 dead transitions. [2023-08-30 02:46:41,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 73 transitions, 468 flow [2023-08-30 02:46:41,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:46:41,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:46:41,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 887 transitions. [2023-08-30 02:46:41,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45440573770491804 [2023-08-30 02:46:41,006 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 887 transitions. [2023-08-30 02:46:41,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 887 transitions. [2023-08-30 02:46:41,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:41,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 887 transitions. [2023-08-30 02:46:41,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 110.875) internal successors, (887), 8 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:41,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 244.0) internal successors, (2196), 9 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:41,012 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 244.0) internal successors, (2196), 9 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:41,012 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 132 flow. Second operand 8 states and 887 transitions. [2023-08-30 02:46:41,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 73 transitions, 468 flow [2023-08-30 02:46:41,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 73 transitions, 406 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-30 02:46:41,018 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 138 flow [2023-08-30 02:46:41,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=138, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2023-08-30 02:46:41,021 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2023-08-30 02:46:41,021 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 138 flow [2023-08-30 02:46:41,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.625) internal successors, (853), 8 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:41,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:41,022 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, 1, 1] [2023-08-30 02:46:41,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-30 02:46:41,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:46:41,232 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:41,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:41,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1707543001, now seen corresponding path program 2 times [2023-08-30 02:46:41,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:46:41,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357274318] [2023-08-30 02:46:41,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:46:41,234 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:46:41,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:46:41,235 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:46:41,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-30 02:46:41,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:46:41,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:46:41,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:46:41,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:46:41,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:46:41,389 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:46:41,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:46:41,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357274318] [2023-08-30 02:46:41,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357274318] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:41,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:41,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:46:41,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731622612] [2023-08-30 02:46:41,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:41,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:46:41,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:46:41,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:46:41,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:46:41,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 244 [2023-08-30 02:46:41,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:41,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:41,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 244 [2023-08-30 02:46:41,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:41,617 INFO L130 PetriNetUnfolder]: 381/720 cut-off events. [2023-08-30 02:46:41,618 INFO L131 PetriNetUnfolder]: For 575/575 co-relation queries the response was YES. [2023-08-30 02:46:41,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2045 conditions, 720 events. 381/720 cut-off events. For 575/575 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3363 event pairs, 116 based on Foata normal form. 1/719 useless extension candidates. Maximal degree in co-relation 2035. Up to 302 conditions per place. [2023-08-30 02:46:41,622 INFO L137 encePairwiseOnDemand]: 240/244 looper letters, 60 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2023-08-30 02:46:41,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 66 transitions, 409 flow [2023-08-30 02:46:41,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:46:41,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:46:41,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2023-08-30 02:46:41,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4713114754098361 [2023-08-30 02:46:41,624 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 575 transitions. [2023-08-30 02:46:41,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 575 transitions. [2023-08-30 02:46:41,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:41,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 575 transitions. [2023-08-30 02:46:41,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:41,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:41,628 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:41,628 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 138 flow. Second operand 5 states and 575 transitions. [2023-08-30 02:46:41,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 66 transitions, 409 flow [2023-08-30 02:46:41,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 66 transitions, 396 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:46:41,632 INFO L231 Difference]: Finished difference. Result has 53 places, 37 transitions, 167 flow [2023-08-30 02:46:41,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2023-08-30 02:46:41,633 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2023-08-30 02:46:41,633 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 37 transitions, 167 flow [2023-08-30 02:46:41,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:41,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:41,634 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, 1, 1] [2023-08-30 02:46:41,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-30 02:46:41,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:46:41,844 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:41,844 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:41,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1936408768, now seen corresponding path program 1 times [2023-08-30 02:46:41,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:46:41,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332781976] [2023-08-30 02:46:41,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:41,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:46:41,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:46:41,846 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:46:41,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-30 02:46:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:42,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-30 02:46:42,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:46:42,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:46:42,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:46:42,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:46:42,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332781976] [2023-08-30 02:46:42,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [332781976] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:42,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:42,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:46:42,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316913427] [2023-08-30 02:46:42,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:42,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:46:42,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:46:42,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:46:42,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:46:42,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 244 [2023-08-30 02:46:42,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 37 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:42,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:42,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 244 [2023-08-30 02:46:42,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:42,728 INFO L130 PetriNetUnfolder]: 321/618 cut-off events. [2023-08-30 02:46:42,728 INFO L131 PetriNetUnfolder]: For 443/443 co-relation queries the response was YES. [2023-08-30 02:46:42,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1778 conditions, 618 events. 321/618 cut-off events. For 443/443 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2896 event pairs, 107 based on Foata normal form. 4/617 useless extension candidates. Maximal degree in co-relation 1765. Up to 536 conditions per place. [2023-08-30 02:46:42,732 INFO L137 encePairwiseOnDemand]: 240/244 looper letters, 31 selfloop transitions, 3 changer transitions 12/49 dead transitions. [2023-08-30 02:46:42,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 49 transitions, 305 flow [2023-08-30 02:46:42,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:46:42,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:46:42,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2023-08-30 02:46:42,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4245901639344262 [2023-08-30 02:46:42,734 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 518 transitions. [2023-08-30 02:46:42,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 518 transitions. [2023-08-30 02:46:42,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:42,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 518 transitions. [2023-08-30 02:46:42,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:42,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:42,738 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:42,738 INFO L175 Difference]: Start difference. First operand has 53 places, 37 transitions, 167 flow. Second operand 5 states and 518 transitions. [2023-08-30 02:46:42,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 49 transitions, 305 flow [2023-08-30 02:46:42,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 49 transitions, 304 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:46:42,742 INFO L231 Difference]: Finished difference. Result has 55 places, 30 transitions, 128 flow [2023-08-30 02:46:42,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=55, PETRI_TRANSITIONS=30} [2023-08-30 02:46:42,742 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2023-08-30 02:46:42,743 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 30 transitions, 128 flow [2023-08-30 02:46:42,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:42,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:42,743 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, 1, 1] [2023-08-30 02:46:42,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-30 02:46:42,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:46:42,954 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:46:42,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:42,954 INFO L85 PathProgramCache]: Analyzing trace with hash 887115143, now seen corresponding path program 3 times [2023-08-30 02:46:42,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:46:42,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144375314] [2023-08-30 02:46:42,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:46:42,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:46:42,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:46:42,956 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-30 02:46:42,959 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-30 02:46:43,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 02:46:43,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 02:46:43,077 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:46:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:46:43,187 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 02:46:43,188 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:46:43,189 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-30 02:46:43,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-30 02:46:43,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-30 02:46:43,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-30 02:46:43,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-30 02:46:43,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-30 02:46:43,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-30 02:46:43,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-30 02:46:43,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-30 02:46:43,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-30 02:46:43,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-30 02:46:43,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-30 02:46:43,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-30 02:46:43,205 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-30 02:46:43,403 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-30 02:46:43,403 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:43,407 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:46:43,407 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:46:43,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:46:43 BasicIcfg [2023-08-30 02:46:43,492 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:46:43,492 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:46:43,492 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:46:43,493 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:46:43,493 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:46:30" (3/4) ... [2023-08-30 02:46:43,495 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:46:43,496 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:46:43,497 INFO L158 Benchmark]: Toolchain (without parser) took 14461.74ms. Allocated memory was 69.2MB in the beginning and 205.5MB in the end (delta: 136.3MB). Free memory was 45.4MB in the beginning and 88.2MB in the end (delta: -42.8MB). Peak memory consumption was 96.6MB. Max. memory is 16.1GB. [2023-08-30 02:46:43,497 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 56.6MB. Free memory was 34.7MB in the beginning and 34.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:46:43,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 568.20ms. Allocated memory is still 69.2MB. Free memory was 45.1MB in the beginning and 38.0MB in the end (delta: 7.2MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2023-08-30 02:46:43,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.12ms. Allocated memory is still 69.2MB. Free memory was 38.0MB in the beginning and 35.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:46:43,500 INFO L158 Benchmark]: Boogie Preprocessor took 56.28ms. Allocated memory is still 69.2MB. Free memory was 35.5MB in the beginning and 33.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:46:43,502 INFO L158 Benchmark]: RCFGBuilder took 704.82ms. Allocated memory is still 69.2MB. Free memory was 33.2MB in the beginning and 28.8MB in the end (delta: 4.4MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2023-08-30 02:46:43,503 INFO L158 Benchmark]: TraceAbstraction took 13043.68ms. Allocated memory was 69.2MB in the beginning and 205.5MB in the end (delta: 136.3MB). Free memory was 28.2MB in the beginning and 89.2MB in the end (delta: -61.0MB). Peak memory consumption was 77.4MB. Max. memory is 16.1GB. [2023-08-30 02:46:43,503 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 205.5MB. Free memory was 89.2MB in the beginning and 88.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:46:43,505 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.13ms. Allocated memory is still 56.6MB. Free memory was 34.7MB in the beginning and 34.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 568.20ms. Allocated memory is still 69.2MB. Free memory was 45.1MB in the beginning and 38.0MB in the end (delta: 7.2MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.12ms. Allocated memory is still 69.2MB. Free memory was 38.0MB in the beginning and 35.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.28ms. Allocated memory is still 69.2MB. Free memory was 35.5MB in the beginning and 33.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 704.82ms. Allocated memory is still 69.2MB. Free memory was 33.2MB in the beginning and 28.8MB in the end (delta: 4.4MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13043.68ms. Allocated memory was 69.2MB in the beginning and 205.5MB in the end (delta: 136.3MB). Free memory was 28.2MB in the beginning and 89.2MB in the end (delta: -61.0MB). Peak memory consumption was 77.4MB. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 205.5MB. Free memory was 89.2MB in the beginning and 88.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: 6.2s, 131 PlacesBefore, 44 PlacesAfterwards, 123 TransitionsBefore, 35 TransitionsAfterwards, 2498 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 118 TotalNumberOfCompositions, 7536 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3274, independent: 3053, independent conditional: 0, independent unconditional: 3053, dependent: 221, dependent conditional: 0, dependent unconditional: 221, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1320, independent: 1285, independent conditional: 0, independent unconditional: 1285, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3274, independent: 1768, independent conditional: 0, independent unconditional: 1768, dependent: 186, dependent conditional: 0, dependent unconditional: 186, unknown: 1320, unknown conditional: 0, unknown unconditional: 1320] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 137, Positive conditional cache size: 0, Positive unconditional cache size: 137, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, 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_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool a$flush_delayed; [L723] 0 int a$mem_tmp; [L724] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$read_delayed; [L733] 0 int *a$read_delayed_var; [L734] 0 int a$w_buff0; [L735] 0 _Bool a$w_buff0_used; [L736] 0 int a$w_buff1; [L737] 0 _Bool a$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L850] 0 pthread_t t385; [L851] FCALL, FORK 0 pthread_create(&t385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t385, ((void *)0), P0, ((void *)0))=0, t385={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 [L766] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L769] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L852] 0 pthread_t t386; [L853] FCALL, FORK 0 pthread_create(&t386, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t386, ((void *)0), P1, ((void *)0))=1, t385={3:0}, t386={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L789] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L854] 0 pthread_t t387; [L855] FCALL, FORK 0 pthread_create(&t387, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t387, ((void *)0), P2, ((void *)0))=2, t385={3:0}, t386={7:0}, t387={11:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 a$flush_delayed = weak$$choice2 [L815] 3 a$mem_tmp = a [L816] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L817] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L818] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L819] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L820] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L822] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EBX = a [L824] 3 a = a$flush_delayed ? a$mem_tmp : a [L825] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L828] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L830] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L832] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t385={3:0}, t386={7:0}, t387={11:0}, weak$$choice2=0, x=1, y=1, z=1] [L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] 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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 848]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 853]: 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: 855]: 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, 156 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: 12.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 333 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 238 mSDsluCounter, 173 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 133 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1044 IncrementalHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 40 mSDtfsCounter, 1044 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=7, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 143 NumberOfCodeBlocks, 143 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 111 ConstructedInterpolants, 14 QuantifiedInterpolants, 1135 SizeOfPredicates, 7 NumberOfNonLiveVariables, 971 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 02:46:43,525 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