./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix038.opt.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/mix038.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8aba011b4454b6464ed30c6424ccbb7bc43e89a3e2bf826373810de7cb8fe97a --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:53:57,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:53:57,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:53:57,712 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:53:57,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:53:57,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:53:57,718 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:53:57,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:53:57,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:53:57,727 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:53:57,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:53:57,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:53:57,730 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:53:57,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:53:57,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:53:57,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:53:57,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:53:57,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:53:57,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:53:57,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:53:57,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:53:57,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:53:57,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:53:57,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:53:57,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:53:57,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:53:57,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:53:57,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:53:57,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:53:57,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:53:57,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:53:57,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:53:57,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:53:57,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:53:57,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:53:57,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:53:57,765 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:53:57,765 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:53:57,765 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:53:57,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:53:57,766 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:53:57,768 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:53:57,800 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:53:57,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:53:57,801 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:53:57,801 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:53:57,802 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:53:57,802 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:53:57,803 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:53:57,803 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:53:57,803 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:53:57,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:53:57,804 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:53:57,804 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:53:57,805 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:53:57,805 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:53:57,805 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:53:57,805 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:53:57,805 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:53:57,806 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:53:57,806 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:53:57,806 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:53:57,806 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:53:57,806 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:53:57,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:53:57,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:53:57,807 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:53:57,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:53:57,807 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:53:57,807 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:53:57,808 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:53:57,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:53:57,808 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:53:57,808 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:53:57,808 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:53:57,809 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:53:57,809 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 -> 8aba011b4454b6464ed30c6424ccbb7bc43e89a3e2bf826373810de7cb8fe97a Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 02:53:58,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:53:58,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:53:58,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:53:58,133 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:53:58,133 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:53:58,134 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038.opt.i [2023-08-30 02:53:59,185 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:53:59,435 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:53:59,436 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038.opt.i [2023-08-30 02:53:59,446 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60787d523/354e864b04b24243a0a714e497c8a669/FLAG1e41275f0 [2023-08-30 02:53:59,460 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60787d523/354e864b04b24243a0a714e497c8a669 [2023-08-30 02:53:59,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:53:59,464 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:53:59,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:53:59,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:53:59,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:53:59,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:53:59" (1/1) ... [2023-08-30 02:53:59,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@150f4e95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:59, skipping insertion in model container [2023-08-30 02:53:59,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:53:59" (1/1) ... [2023-08-30 02:53:59,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:53:59,529 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:53:59,649 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/mix038.opt.i[944,957] [2023-08-30 02:53:59,843 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:53:59,856 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:53:59,867 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/mix038.opt.i[944,957] [2023-08-30 02:53:59,915 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:53:59,954 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:53:59,954 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:53:59,960 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:53:59,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:59 WrapperNode [2023-08-30 02:53:59,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:53:59,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:53:59,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:53:59,962 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:53:59,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:59" (1/1) ... [2023-08-30 02:53:59,996 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:59" (1/1) ... [2023-08-30 02:54:00,030 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136 [2023-08-30 02:54:00,031 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:54:00,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:54:00,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:54:00,032 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:54:00,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:59" (1/1) ... [2023-08-30 02:54:00,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:59" (1/1) ... [2023-08-30 02:54:00,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:59" (1/1) ... [2023-08-30 02:54:00,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:59" (1/1) ... [2023-08-30 02:54:00,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:59" (1/1) ... [2023-08-30 02:54:00,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:59" (1/1) ... [2023-08-30 02:54:00,078 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:59" (1/1) ... [2023-08-30 02:54:00,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:59" (1/1) ... [2023-08-30 02:54:00,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:54:00,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:54:00,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:54:00,087 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:54:00,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:59" (1/1) ... [2023-08-30 02:54:00,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:54:00,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:54:00,121 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:54:00,149 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:54:00,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:54:00,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:54:00,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:54:00,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:54:00,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:54:00,171 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:54:00,171 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:54:00,171 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:54:00,171 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:54:00,171 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:54:00,171 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:54:00,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:54:00,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:54:00,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:54:00,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:54:00,173 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:54:00,342 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:54:00,344 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:54:00,577 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:54:00,733 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:54:00,733 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:54:00,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:54:00 BoogieIcfgContainer [2023-08-30 02:54:00,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:54:00,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:54:00,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:54:00,738 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:54:00,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:53:59" (1/3) ... [2023-08-30 02:54:00,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6872d645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:54:00, skipping insertion in model container [2023-08-30 02:54:00,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:59" (2/3) ... [2023-08-30 02:54:00,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6872d645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:54:00, skipping insertion in model container [2023-08-30 02:54:00,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:54:00" (3/3) ... [2023-08-30 02:54:00,741 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038.opt.i [2023-08-30 02:54:00,755 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:54:00,755 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-30 02:54:00,755 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:54:00,812 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:54:00,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 120 transitions, 255 flow [2023-08-30 02:54:00,901 INFO L130 PetriNetUnfolder]: 2/117 cut-off events. [2023-08-30 02:54:00,902 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:54:00,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-30 02:54:00,907 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 120 transitions, 255 flow [2023-08-30 02:54:00,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 117 transitions, 243 flow [2023-08-30 02:54:00,914 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:54:00,922 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 117 transitions, 243 flow [2023-08-30 02:54:00,925 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 117 transitions, 243 flow [2023-08-30 02:54:00,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 243 flow [2023-08-30 02:54:00,952 INFO L130 PetriNetUnfolder]: 2/117 cut-off events. [2023-08-30 02:54:00,953 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:54:00,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-30 02:54:00,955 INFO L119 LiptonReduction]: Number of co-enabled transitions 2044 [2023-08-30 02:54:05,341 INFO L134 LiptonReduction]: Checked pairs total: 5120 [2023-08-30 02:54:05,342 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-30 02:54:05,357 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:54:05,363 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;@5e39dac5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:54:05,364 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-30 02:54:05,366 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:54:05,366 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:54:05,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:05,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:54:05,368 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:54:05,372 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:05,372 INFO L85 PathProgramCache]: Analyzing trace with hash 506, now seen corresponding path program 1 times [2023-08-30 02:54:05,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:05,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213147496] [2023-08-30 02:54:05,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:05,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:05,459 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:54:05,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:05,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213147496] [2023-08-30 02:54:05,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213147496] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:05,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:05,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:54:05,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422739328] [2023-08-30 02:54:05,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:05,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:54:05,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:05,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:54:05,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:54:05,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 236 [2023-08-30 02:54:05,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 109.5) internal successors, (219), 2 states have internal predecessors, (219), 0 states have call successors, (0), 0 states 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:54:05,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:05,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 236 [2023-08-30 02:54:05,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:05,833 INFO L130 PetriNetUnfolder]: 1101/1662 cut-off events. [2023-08-30 02:54:05,834 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2023-08-30 02:54:05,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3335 conditions, 1662 events. 1101/1662 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7683 event pairs, 1101 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 3324. Up to 1637 conditions per place. [2023-08-30 02:54:05,848 INFO L137 encePairwiseOnDemand]: 229/236 looper letters, 22 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2023-08-30 02:54:05,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 101 flow [2023-08-30 02:54:05,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:54:05,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:54:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 247 transitions. [2023-08-30 02:54:05,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5233050847457628 [2023-08-30 02:54:05,865 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 247 transitions. [2023-08-30 02:54:05,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 247 transitions. [2023-08-30 02:54:05,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:05,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 247 transitions. [2023-08-30 02:54:05,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 123.5) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:05,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states 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:54:05,879 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states 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:54:05,880 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 2 states and 247 transitions. [2023-08-30 02:54:05,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 101 flow [2023-08-30 02:54:05,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 98 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:54:05,886 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow [2023-08-30 02:54:05,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-08-30 02:54:05,892 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2023-08-30 02:54:05,892 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow [2023-08-30 02:54:05,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 109.5) internal successors, (219), 2 states have internal predecessors, (219), 0 states have call successors, (0), 0 states 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:54:05,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:05,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:05,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:54:05,895 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:54:05,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:05,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1996752140, now seen corresponding path program 1 times [2023-08-30 02:54:05,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:05,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458311118] [2023-08-30 02:54:05,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:05,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:06,233 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:54:06,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:06,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458311118] [2023-08-30 02:54:06,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458311118] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:06,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:06,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:54:06,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274479509] [2023-08-30 02:54:06,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:06,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:54:06,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:06,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:54:06,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:54:06,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 236 [2023-08-30 02:54:06,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:06,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:06,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 236 [2023-08-30 02:54:06,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:06,440 INFO L130 PetriNetUnfolder]: 910/1447 cut-off events. [2023-08-30 02:54:06,441 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:54:06,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2843 conditions, 1447 events. 910/1447 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7163 event pairs, 146 based on Foata normal form. 0/1326 useless extension candidates. Maximal degree in co-relation 2840. Up to 1101 conditions per place. [2023-08-30 02:54:06,449 INFO L137 encePairwiseOnDemand]: 233/236 looper letters, 28 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2023-08-30 02:54:06,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 138 flow [2023-08-30 02:54:06,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:54:06,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:54:06,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-30 02:54:06,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042372881355932 [2023-08-30 02:54:06,454 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-30 02:54:06,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-30 02:54:06,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:06,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-30 02:54:06,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states 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:54:06,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states 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:54:06,460 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states 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:54:06,460 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 357 transitions. [2023-08-30 02:54:06,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 138 flow [2023-08-30 02:54:06,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:54:06,462 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-08-30 02:54:06,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-08-30 02:54:06,463 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2023-08-30 02:54:06,463 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-08-30 02:54:06,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:06,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:06,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:06,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:54:06,464 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:54:06,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:06,469 INFO L85 PathProgramCache]: Analyzing trace with hash -971520553, now seen corresponding path program 1 times [2023-08-30 02:54:06,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:06,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230896269] [2023-08-30 02:54:06,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:06,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:06,820 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:54:06,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:06,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230896269] [2023-08-30 02:54:06,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230896269] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:06,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:06,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:54:06,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055450163] [2023-08-30 02:54:06,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:06,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:54:06,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:06,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:54:06,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:54:06,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 236 [2023-08-30 02:54:06,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:06,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:06,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 236 [2023-08-30 02:54:06,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:07,153 INFO L130 PetriNetUnfolder]: 1927/2900 cut-off events. [2023-08-30 02:54:07,154 INFO L131 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2023-08-30 02:54:07,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5999 conditions, 2900 events. 1927/2900 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 14038 event pairs, 635 based on Foata normal form. 0/2812 useless extension candidates. Maximal degree in co-relation 5995. Up to 1829 conditions per place. [2023-08-30 02:54:07,168 INFO L137 encePairwiseOnDemand]: 228/236 looper letters, 32 selfloop transitions, 7 changer transitions 0/39 dead transitions. [2023-08-30 02:54:07,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 39 transitions, 170 flow [2023-08-30 02:54:07,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:54:07,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:54:07,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2023-08-30 02:54:07,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4844632768361582 [2023-08-30 02:54:07,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2023-08-30 02:54:07,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2023-08-30 02:54:07,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:07,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2023-08-30 02:54:07,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states 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:54:07,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states 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:54:07,174 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states 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:54:07,174 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 3 states and 343 transitions. [2023-08-30 02:54:07,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 39 transitions, 170 flow [2023-08-30 02:54:07,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 39 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:54:07,177 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 104 flow [2023-08-30 02:54:07,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2023-08-30 02:54:07,178 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -6 predicate places. [2023-08-30 02:54:07,178 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 104 flow [2023-08-30 02:54:07,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:07,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:07,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:07,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:54:07,179 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:54:07,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:07,180 INFO L85 PathProgramCache]: Analyzing trace with hash -52367559, now seen corresponding path program 1 times [2023-08-30 02:54:07,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:07,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586794497] [2023-08-30 02:54:07,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:07,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:07,417 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:54:07,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:07,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586794497] [2023-08-30 02:54:07,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586794497] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:07,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:07,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:54:07,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401258293] [2023-08-30 02:54:07,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:07,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:54:07,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:07,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:54:07,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:54:07,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 236 [2023-08-30 02:54:07,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:07,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:07,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 236 [2023-08-30 02:54:07,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:07,680 INFO L130 PetriNetUnfolder]: 1535/2405 cut-off events. [2023-08-30 02:54:07,681 INFO L131 PetriNetUnfolder]: For 1189/1190 co-relation queries the response was YES. [2023-08-30 02:54:07,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6114 conditions, 2405 events. 1535/2405 cut-off events. For 1189/1190 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12272 event pairs, 503 based on Foata normal form. 24/2396 useless extension candidates. Maximal degree in co-relation 6109. Up to 1537 conditions per place. [2023-08-30 02:54:07,695 INFO L137 encePairwiseOnDemand]: 233/236 looper letters, 32 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2023-08-30 02:54:07,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 212 flow [2023-08-30 02:54:07,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:54:07,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:54:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2023-08-30 02:54:07,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4957627118644068 [2023-08-30 02:54:07,697 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2023-08-30 02:54:07,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2023-08-30 02:54:07,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:07,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2023-08-30 02:54:07,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:07,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states 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:54:07,701 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states 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:54:07,701 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 104 flow. Second operand 3 states and 351 transitions. [2023-08-30 02:54:07,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 212 flow [2023-08-30 02:54:07,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:54:07,706 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 101 flow [2023-08-30 02:54:07,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2023-08-30 02:54:07,707 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2023-08-30 02:54:07,708 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 101 flow [2023-08-30 02:54:07,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:07,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:07,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:07,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:54:07,709 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:54:07,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:07,709 INFO L85 PathProgramCache]: Analyzing trace with hash -52365425, now seen corresponding path program 1 times [2023-08-30 02:54:07,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:07,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256786071] [2023-08-30 02:54:07,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:07,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:08,091 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:54:08,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:08,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256786071] [2023-08-30 02:54:08,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256786071] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:08,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:08,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:54:08,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615414639] [2023-08-30 02:54:08,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:08,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:54:08,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:08,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:54:08,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:54:08,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 236 [2023-08-30 02:54:08,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 101 flow. Second operand has 6 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 0 states have call successors, (0), 0 states 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:54:08,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:08,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 236 [2023-08-30 02:54:08,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:08,612 INFO L130 PetriNetUnfolder]: 1473/2361 cut-off events. [2023-08-30 02:54:08,612 INFO L131 PetriNetUnfolder]: For 783/783 co-relation queries the response was YES. [2023-08-30 02:54:08,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5797 conditions, 2361 events. 1473/2361 cut-off events. For 783/783 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 12571 event pairs, 237 based on Foata normal form. 112/2444 useless extension candidates. Maximal degree in co-relation 5791. Up to 1471 conditions per place. [2023-08-30 02:54:08,625 INFO L137 encePairwiseOnDemand]: 230/236 looper letters, 35 selfloop transitions, 5 changer transitions 14/58 dead transitions. [2023-08-30 02:54:08,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 58 transitions, 303 flow [2023-08-30 02:54:08,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:54:08,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:54:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 615 transitions. [2023-08-30 02:54:08,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4343220338983051 [2023-08-30 02:54:08,627 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 615 transitions. [2023-08-30 02:54:08,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 615 transitions. [2023-08-30 02:54:08,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:08,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 615 transitions. [2023-08-30 02:54:08,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.5) internal successors, (615), 6 states have internal predecessors, (615), 0 states have call successors, (0), 0 states 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:54:08,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states 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:54:08,632 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states 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:54:08,633 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 101 flow. Second operand 6 states and 615 transitions. [2023-08-30 02:54:08,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 58 transitions, 303 flow [2023-08-30 02:54:08,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 58 transitions, 293 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:54:08,635 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 114 flow [2023-08-30 02:54:08,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-08-30 02:54:08,636 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-30 02:54:08,636 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 114 flow [2023-08-30 02:54:08,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 0 states have call successors, (0), 0 states 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:54:08,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:08,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:08,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:54:08,637 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:54:08,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:08,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1662542462, now seen corresponding path program 1 times [2023-08-30 02:54:08,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:08,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125921186] [2023-08-30 02:54:08,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:08,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:08,830 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:54:08,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:08,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125921186] [2023-08-30 02:54:08,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125921186] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:08,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:08,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:54:08,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550651229] [2023-08-30 02:54:08,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:08,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:54:08,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:08,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:54:08,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:54:08,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 236 [2023-08-30 02:54:08,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:08,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:08,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 236 [2023-08-30 02:54:08,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:09,120 INFO L130 PetriNetUnfolder]: 1541/2342 cut-off events. [2023-08-30 02:54:09,121 INFO L131 PetriNetUnfolder]: For 827/827 co-relation queries the response was YES. [2023-08-30 02:54:09,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6146 conditions, 2342 events. 1541/2342 cut-off events. For 827/827 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11111 event pairs, 263 based on Foata normal form. 8/2350 useless extension candidates. Maximal degree in co-relation 6138. Up to 1415 conditions per place. [2023-08-30 02:54:09,134 INFO L137 encePairwiseOnDemand]: 228/236 looper letters, 47 selfloop transitions, 11 changer transitions 0/58 dead transitions. [2023-08-30 02:54:09,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 58 transitions, 330 flow [2023-08-30 02:54:09,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:54:09,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:54:09,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 460 transitions. [2023-08-30 02:54:09,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4872881355932203 [2023-08-30 02:54:09,136 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 460 transitions. [2023-08-30 02:54:09,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 460 transitions. [2023-08-30 02:54:09,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:09,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 460 transitions. [2023-08-30 02:54:09,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:09,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states 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:54:09,139 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states 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:54:09,140 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 114 flow. Second operand 4 states and 460 transitions. [2023-08-30 02:54:09,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 58 transitions, 330 flow [2023-08-30 02:54:09,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 58 transitions, 306 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-30 02:54:09,144 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 190 flow [2023-08-30 02:54:09,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2023-08-30 02:54:09,145 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-30 02:54:09,146 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 190 flow [2023-08-30 02:54:09,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:09,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:09,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:09,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:54:09,147 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:54:09,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:09,147 INFO L85 PathProgramCache]: Analyzing trace with hash 799042, now seen corresponding path program 1 times [2023-08-30 02:54:09,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:09,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110672797] [2023-08-30 02:54:09,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:09,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:09,316 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:54:09,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:09,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110672797] [2023-08-30 02:54:09,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110672797] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:09,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:09,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:54:09,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964963] [2023-08-30 02:54:09,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:09,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:54:09,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:09,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:54:09,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:54:09,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 236 [2023-08-30 02:54:09,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states 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:54:09,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:09,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 236 [2023-08-30 02:54:09,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:09,577 INFO L130 PetriNetUnfolder]: 871/1467 cut-off events. [2023-08-30 02:54:09,577 INFO L131 PetriNetUnfolder]: For 1648/1694 co-relation queries the response was YES. [2023-08-30 02:54:09,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4260 conditions, 1467 events. 871/1467 cut-off events. For 1648/1694 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7584 event pairs, 167 based on Foata normal form. 138/1577 useless extension candidates. Maximal degree in co-relation 4251. Up to 985 conditions per place. [2023-08-30 02:54:09,585 INFO L137 encePairwiseOnDemand]: 230/236 looper letters, 54 selfloop transitions, 7 changer transitions 14/81 dead transitions. [2023-08-30 02:54:09,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 81 transitions, 559 flow [2023-08-30 02:54:09,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:54:09,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:54:09,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 559 transitions. [2023-08-30 02:54:09,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47372881355932206 [2023-08-30 02:54:09,588 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 559 transitions. [2023-08-30 02:54:09,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 559 transitions. [2023-08-30 02:54:09,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:09,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 559 transitions. [2023-08-30 02:54:09,590 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:54:09,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states 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:54:09,592 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states 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:54:09,592 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 190 flow. Second operand 5 states and 559 transitions. [2023-08-30 02:54:09,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 81 transitions, 559 flow [2023-08-30 02:54:09,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 81 transitions, 559 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:54:09,597 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 238 flow [2023-08-30 02:54:09,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=238, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-08-30 02:54:09,598 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2023-08-30 02:54:09,599 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 238 flow [2023-08-30 02:54:09,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states 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:54:09,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:09,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:09,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:54:09,600 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:54:09,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:09,600 INFO L85 PathProgramCache]: Analyzing trace with hash -817770595, now seen corresponding path program 1 times [2023-08-30 02:54:09,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:09,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606214495] [2023-08-30 02:54:09,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:09,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:09,782 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:54:09,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:09,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606214495] [2023-08-30 02:54:09,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606214495] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:09,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:09,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:54:09,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138172498] [2023-08-30 02:54:09,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:09,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:54:09,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:09,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:54:09,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:54:09,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 236 [2023-08-30 02:54:09,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 238 flow. Second operand has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:09,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:09,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 236 [2023-08-30 02:54:09,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:10,081 INFO L130 PetriNetUnfolder]: 1237/2090 cut-off events. [2023-08-30 02:54:10,081 INFO L131 PetriNetUnfolder]: For 3514/3514 co-relation queries the response was YES. [2023-08-30 02:54:10,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7713 conditions, 2090 events. 1237/2090 cut-off events. For 3514/3514 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10986 event pairs, 326 based on Foata normal form. 23/2113 useless extension candidates. Maximal degree in co-relation 7700. Up to 1016 conditions per place. [2023-08-30 02:54:10,094 INFO L137 encePairwiseOnDemand]: 228/236 looper letters, 54 selfloop transitions, 13 changer transitions 7/74 dead transitions. [2023-08-30 02:54:10,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 74 transitions, 545 flow [2023-08-30 02:54:10,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:54:10,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:54:10,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 459 transitions. [2023-08-30 02:54:10,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.486228813559322 [2023-08-30 02:54:10,096 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 459 transitions. [2023-08-30 02:54:10,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 459 transitions. [2023-08-30 02:54:10,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:10,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 459 transitions. [2023-08-30 02:54:10,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:10,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states 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:54:10,100 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states 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:54:10,100 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 238 flow. Second operand 4 states and 459 transitions. [2023-08-30 02:54:10,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 74 transitions, 545 flow [2023-08-30 02:54:10,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 74 transitions, 538 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:54:10,108 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 302 flow [2023-08-30 02:54:10,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2023-08-30 02:54:10,109 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2023-08-30 02:54:10,109 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 302 flow [2023-08-30 02:54:10,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:10,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:10,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:10,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:54:10,110 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:54:10,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:10,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1432466405, now seen corresponding path program 1 times [2023-08-30 02:54:10,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:10,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476357842] [2023-08-30 02:54:10,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:10,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:10,299 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:54:10,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:10,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476357842] [2023-08-30 02:54:10,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476357842] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:10,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:10,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:54:10,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431617459] [2023-08-30 02:54:10,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:10,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:54:10,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:10,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:54:10,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:54:10,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 236 [2023-08-30 02:54:10,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 302 flow. Second operand has 5 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:10,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:10,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 236 [2023-08-30 02:54:10,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:10,513 INFO L130 PetriNetUnfolder]: 456/874 cut-off events. [2023-08-30 02:54:10,513 INFO L131 PetriNetUnfolder]: For 1934/1950 co-relation queries the response was YES. [2023-08-30 02:54:10,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3260 conditions, 874 events. 456/874 cut-off events. For 1934/1950 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4484 event pairs, 71 based on Foata normal form. 98/959 useless extension candidates. Maximal degree in co-relation 3245. Up to 348 conditions per place. [2023-08-30 02:54:10,517 INFO L137 encePairwiseOnDemand]: 230/236 looper letters, 56 selfloop transitions, 10 changer transitions 20/93 dead transitions. [2023-08-30 02:54:10,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 93 transitions, 788 flow [2023-08-30 02:54:10,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:54:10,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:54:10,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 671 transitions. [2023-08-30 02:54:10,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738700564971751 [2023-08-30 02:54:10,520 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 671 transitions. [2023-08-30 02:54:10,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 671 transitions. [2023-08-30 02:54:10,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:10,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 671 transitions. [2023-08-30 02:54:10,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 states 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:54:10,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states 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:54:10,525 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states 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:54:10,525 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 302 flow. Second operand 6 states and 671 transitions. [2023-08-30 02:54:10,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 93 transitions, 788 flow [2023-08-30 02:54:10,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 93 transitions, 746 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-30 02:54:10,531 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 350 flow [2023-08-30 02:54:10,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=350, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2023-08-30 02:54:10,532 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2023-08-30 02:54:10,532 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 350 flow [2023-08-30 02:54:10,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:10,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:10,533 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:54:10,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:54:10,533 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:54:10,533 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:10,534 INFO L85 PathProgramCache]: Analyzing trace with hash 207621466, now seen corresponding path program 1 times [2023-08-30 02:54:10,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:10,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610094056] [2023-08-30 02:54:10,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:10,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:10,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:54:10,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:10,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610094056] [2023-08-30 02:54:10,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610094056] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:10,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:10,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:54:10,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588081199] [2023-08-30 02:54:10,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:10,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:54:10,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:10,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:54:10,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:54:10,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 236 [2023-08-30 02:54:10,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 350 flow. Second operand has 6 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 0 states have call successors, (0), 0 states 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:54:10,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:10,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 236 [2023-08-30 02:54:10,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:10,920 INFO L130 PetriNetUnfolder]: 360/698 cut-off events. [2023-08-30 02:54:10,921 INFO L131 PetriNetUnfolder]: For 1607/1613 co-relation queries the response was YES. [2023-08-30 02:54:10,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2986 conditions, 698 events. 360/698 cut-off events. For 1607/1613 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3525 event pairs, 52 based on Foata normal form. 35/724 useless extension candidates. Maximal degree in co-relation 2968. Up to 297 conditions per place. [2023-08-30 02:54:10,928 INFO L137 encePairwiseOnDemand]: 230/236 looper letters, 52 selfloop transitions, 14 changer transitions 19/90 dead transitions. [2023-08-30 02:54:10,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 90 transitions, 768 flow [2023-08-30 02:54:10,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:54:10,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:54:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 873 transitions. [2023-08-30 02:54:10,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4623940677966102 [2023-08-30 02:54:10,931 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 873 transitions. [2023-08-30 02:54:10,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 873 transitions. [2023-08-30 02:54:10,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:10,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 873 transitions. [2023-08-30 02:54:10,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 109.125) internal successors, (873), 8 states have internal predecessors, (873), 0 states have call successors, (0), 0 states 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:54:10,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states 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:54:10,937 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states 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:54:10,937 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 350 flow. Second operand 8 states and 873 transitions. [2023-08-30 02:54:10,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 90 transitions, 768 flow [2023-08-30 02:54:10,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 90 transitions, 699 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-08-30 02:54:10,951 INFO L231 Difference]: Finished difference. Result has 62 places, 43 transitions, 321 flow [2023-08-30 02:54:10,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=321, PETRI_PLACES=62, PETRI_TRANSITIONS=43} [2023-08-30 02:54:10,953 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places. [2023-08-30 02:54:10,953 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 43 transitions, 321 flow [2023-08-30 02:54:10,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 0 states have call successors, (0), 0 states 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:54:10,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:10,955 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:54:10,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:54:10,955 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:54:10,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:10,956 INFO L85 PathProgramCache]: Analyzing trace with hash -617258095, now seen corresponding path program 1 times [2023-08-30 02:54:10,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:10,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662764413] [2023-08-30 02:54:10,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:10,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:11,219 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:54:11,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:11,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662764413] [2023-08-30 02:54:11,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662764413] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:11,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:11,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:54:11,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614285276] [2023-08-30 02:54:11,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:11,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:54:11,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:11,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:54:11,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:54:11,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 236 [2023-08-30 02:54:11,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 43 transitions, 321 flow. Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states 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:54:11,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:11,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 236 [2023-08-30 02:54:11,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:11,408 INFO L130 PetriNetUnfolder]: 499/958 cut-off events. [2023-08-30 02:54:11,408 INFO L131 PetriNetUnfolder]: For 3070/3070 co-relation queries the response was YES. [2023-08-30 02:54:11,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4160 conditions, 958 events. 499/958 cut-off events. For 3070/3070 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4953 event pairs, 75 based on Foata normal form. 1/959 useless extension candidates. Maximal degree in co-relation 4141. Up to 467 conditions per place. [2023-08-30 02:54:11,414 INFO L137 encePairwiseOnDemand]: 227/236 looper letters, 63 selfloop transitions, 18 changer transitions 11/92 dead transitions. [2023-08-30 02:54:11,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 92 transitions, 837 flow [2023-08-30 02:54:11,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:54:11,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:54:11,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 552 transitions. [2023-08-30 02:54:11,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46779661016949153 [2023-08-30 02:54:11,416 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 552 transitions. [2023-08-30 02:54:11,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 552 transitions. [2023-08-30 02:54:11,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:11,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 552 transitions. [2023-08-30 02:54:11,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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:54:11,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states 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:54:11,420 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states 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:54:11,421 INFO L175 Difference]: Start difference. First operand has 62 places, 43 transitions, 321 flow. Second operand 5 states and 552 transitions. [2023-08-30 02:54:11,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 92 transitions, 837 flow [2023-08-30 02:54:11,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 716 flow, removed 32 selfloop flow, removed 8 redundant places. [2023-08-30 02:54:11,436 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 409 flow [2023-08-30 02:54:11,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=409, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2023-08-30 02:54:11,436 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2023-08-30 02:54:11,436 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 409 flow [2023-08-30 02:54:11,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states 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:54:11,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:11,437 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:54:11,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 02:54:11,437 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:54:11,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:11,438 INFO L85 PathProgramCache]: Analyzing trace with hash -2071739335, now seen corresponding path program 2 times [2023-08-30 02:54:11,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:11,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977359340] [2023-08-30 02:54:11,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:11,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:11,988 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:54:11,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:11,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977359340] [2023-08-30 02:54:11,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977359340] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:11,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:11,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:54:11,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409537109] [2023-08-30 02:54:11,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:11,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:54:11,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:11,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:54:11,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:54:12,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 236 [2023-08-30 02:54:12,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 409 flow. Second operand has 8 states, 8 states have (on average 98.5) internal successors, (788), 8 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:12,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:12,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 236 [2023-08-30 02:54:12,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:12,432 INFO L130 PetriNetUnfolder]: 555/1063 cut-off events. [2023-08-30 02:54:12,432 INFO L131 PetriNetUnfolder]: For 3966/3966 co-relation queries the response was YES. [2023-08-30 02:54:12,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4679 conditions, 1063 events. 555/1063 cut-off events. For 3966/3966 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5574 event pairs, 40 based on Foata normal form. 1/1064 useless extension candidates. Maximal degree in co-relation 4662. Up to 308 conditions per place. [2023-08-30 02:54:12,439 INFO L137 encePairwiseOnDemand]: 225/236 looper letters, 119 selfloop transitions, 54 changer transitions 0/173 dead transitions. [2023-08-30 02:54:12,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 173 transitions, 1740 flow [2023-08-30 02:54:12,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 02:54:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 02:54:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1155 transitions. [2023-08-30 02:54:12,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4449152542372881 [2023-08-30 02:54:12,442 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1155 transitions. [2023-08-30 02:54:12,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1155 transitions. [2023-08-30 02:54:12,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:12,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1155 transitions. [2023-08-30 02:54:12,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 105.0) internal successors, (1155), 11 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states 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:54:12,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 236.0) internal successors, (2832), 12 states have internal predecessors, (2832), 0 states have call successors, (0), 0 states 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:54:12,449 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 236.0) internal successors, (2832), 12 states have internal predecessors, (2832), 0 states have call successors, (0), 0 states 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:54:12,450 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 409 flow. Second operand 11 states and 1155 transitions. [2023-08-30 02:54:12,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 173 transitions, 1740 flow [2023-08-30 02:54:12,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 173 transitions, 1726 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-30 02:54:12,462 INFO L231 Difference]: Finished difference. Result has 70 places, 98 transitions, 1128 flow [2023-08-30 02:54:12,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1128, PETRI_PLACES=70, PETRI_TRANSITIONS=98} [2023-08-30 02:54:12,463 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 30 predicate places. [2023-08-30 02:54:12,463 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 98 transitions, 1128 flow [2023-08-30 02:54:12,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.5) internal successors, (788), 8 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:12,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:12,463 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:54:12,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 02:54:12,464 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:54:12,464 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:12,464 INFO L85 PathProgramCache]: Analyzing trace with hash 739124795, now seen corresponding path program 3 times [2023-08-30 02:54:12,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:12,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386460814] [2023-08-30 02:54:12,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:12,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:12,660 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:54:12,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:12,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386460814] [2023-08-30 02:54:12,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386460814] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:12,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:12,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:54:12,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457914452] [2023-08-30 02:54:12,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:12,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:54:12,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:12,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:54:12,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:54:12,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 236 [2023-08-30 02:54:12,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 98 transitions, 1128 flow. Second operand has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states 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:54:12,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:12,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 236 [2023-08-30 02:54:12,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:12,878 INFO L130 PetriNetUnfolder]: 555/1116 cut-off events. [2023-08-30 02:54:12,878 INFO L131 PetriNetUnfolder]: For 5558/5585 co-relation queries the response was YES. [2023-08-30 02:54:12,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5582 conditions, 1116 events. 555/1116 cut-off events. For 5558/5585 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6351 event pairs, 99 based on Foata normal form. 3/1110 useless extension candidates. Maximal degree in co-relation 5561. Up to 515 conditions per place. [2023-08-30 02:54:12,886 INFO L137 encePairwiseOnDemand]: 233/236 looper letters, 112 selfloop transitions, 9 changer transitions 0/137 dead transitions. [2023-08-30 02:54:12,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 137 transitions, 1658 flow [2023-08-30 02:54:12,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:54:12,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:54:12,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2023-08-30 02:54:12,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4915254237288136 [2023-08-30 02:54:12,888 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 464 transitions. [2023-08-30 02:54:12,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 464 transitions. [2023-08-30 02:54:12,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:12,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 464 transitions. [2023-08-30 02:54:12,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states 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:54:12,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states 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:54:12,891 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states 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:54:12,892 INFO L175 Difference]: Start difference. First operand has 70 places, 98 transitions, 1128 flow. Second operand 4 states and 464 transitions. [2023-08-30 02:54:12,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 137 transitions, 1658 flow [2023-08-30 02:54:12,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 137 transitions, 1656 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-30 02:54:12,913 INFO L231 Difference]: Finished difference. Result has 74 places, 98 transitions, 1151 flow [2023-08-30 02:54:12,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1151, PETRI_PLACES=74, PETRI_TRANSITIONS=98} [2023-08-30 02:54:12,914 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 34 predicate places. [2023-08-30 02:54:12,914 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 98 transitions, 1151 flow [2023-08-30 02:54:12,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states 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:54:12,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:12,914 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:54:12,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 02:54:12,915 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:54:12,915 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:12,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1855815469, now seen corresponding path program 4 times [2023-08-30 02:54:12,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:12,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863931119] [2023-08-30 02:54:12,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:12,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:13,701 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:54:13,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:13,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863931119] [2023-08-30 02:54:13,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863931119] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:13,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:13,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:54:13,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119133103] [2023-08-30 02:54:13,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:13,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:54:13,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:13,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:54:13,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:54:13,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 236 [2023-08-30 02:54:13,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 98 transitions, 1151 flow. Second operand has 7 states, 7 states have (on average 105.57142857142857) internal successors, (739), 7 states have internal predecessors, (739), 0 states have call successors, (0), 0 states 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:54:13,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:13,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 236 [2023-08-30 02:54:13,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:14,059 INFO L130 PetriNetUnfolder]: 587/1296 cut-off events. [2023-08-30 02:54:14,060 INFO L131 PetriNetUnfolder]: For 6538/6572 co-relation queries the response was YES. [2023-08-30 02:54:14,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6269 conditions, 1296 events. 587/1296 cut-off events. For 6538/6572 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8376 event pairs, 98 based on Foata normal form. 6/1288 useless extension candidates. Maximal degree in co-relation 6246. Up to 390 conditions per place. [2023-08-30 02:54:14,070 INFO L137 encePairwiseOnDemand]: 230/236 looper letters, 98 selfloop transitions, 22 changer transitions 0/142 dead transitions. [2023-08-30 02:54:14,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 142 transitions, 1700 flow [2023-08-30 02:54:14,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:54:14,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:54:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 768 transitions. [2023-08-30 02:54:14,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4648910411622276 [2023-08-30 02:54:14,073 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 768 transitions. [2023-08-30 02:54:14,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 768 transitions. [2023-08-30 02:54:14,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:14,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 768 transitions. [2023-08-30 02:54:14,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.71428571428571) internal successors, (768), 7 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:14,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 236.0) internal successors, (1888), 8 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states 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:54:14,078 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 236.0) internal successors, (1888), 8 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states 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:54:14,079 INFO L175 Difference]: Start difference. First operand has 74 places, 98 transitions, 1151 flow. Second operand 7 states and 768 transitions. [2023-08-30 02:54:14,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 142 transitions, 1700 flow [2023-08-30 02:54:14,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 142 transitions, 1687 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:54:14,110 INFO L231 Difference]: Finished difference. Result has 80 places, 101 transitions, 1218 flow [2023-08-30 02:54:14,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1218, PETRI_PLACES=80, PETRI_TRANSITIONS=101} [2023-08-30 02:54:14,111 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 40 predicate places. [2023-08-30 02:54:14,111 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 101 transitions, 1218 flow [2023-08-30 02:54:14,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.57142857142857) internal successors, (739), 7 states have internal predecessors, (739), 0 states have call successors, (0), 0 states 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:54:14,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:14,112 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:54:14,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 02:54:14,112 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:54:14,113 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:14,113 INFO L85 PathProgramCache]: Analyzing trace with hash 2009659941, now seen corresponding path program 5 times [2023-08-30 02:54:14,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:14,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120712556] [2023-08-30 02:54:14,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:14,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:54:14,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:54:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:54:14,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:54:14,201 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:54:14,202 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-30 02:54:14,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-30 02:54:14,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-30 02:54:14,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-30 02:54:14,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-30 02:54:14,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-30 02:54:14,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-30 02:54:14,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-30 02:54:14,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-30 02:54:14,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-30 02:54:14,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-30 02:54:14,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-30 02:54:14,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-30 02:54:14,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 02:54:14,206 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:14,211 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:54:14,211 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:54:14,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:54:14 BasicIcfg [2023-08-30 02:54:14,278 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:54:14,278 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:54:14,279 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:54:14,279 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:54:14,280 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:54:00" (3/4) ... [2023-08-30 02:54:14,282 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:54:14,282 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:54:14,282 INFO L158 Benchmark]: Toolchain (without parser) took 14818.32ms. Allocated memory was 69.2MB in the beginning and 341.8MB in the end (delta: 272.6MB). Free memory was 41.9MB in the beginning and 219.8MB in the end (delta: -178.0MB). Peak memory consumption was 93.6MB. Max. memory is 16.1GB. [2023-08-30 02:54:14,282 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory is still 34.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:54:14,283 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.10ms. Allocated memory is still 69.2MB. Free memory was 41.7MB in the beginning and 36.8MB in the end (delta: 4.9MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2023-08-30 02:54:14,283 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.86ms. Allocated memory is still 69.2MB. Free memory was 36.8MB in the beginning and 34.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:54:14,283 INFO L158 Benchmark]: Boogie Preprocessor took 54.02ms. Allocated memory is still 69.2MB. Free memory was 34.3MB in the beginning and 32.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:54:14,284 INFO L158 Benchmark]: RCFGBuilder took 648.43ms. Allocated memory is still 69.2MB. Free memory was 32.6MB in the beginning and 41.3MB in the end (delta: -8.8MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2023-08-30 02:54:14,284 INFO L158 Benchmark]: TraceAbstraction took 13541.69ms. Allocated memory was 69.2MB in the beginning and 341.8MB in the end (delta: 272.6MB). Free memory was 40.6MB in the beginning and 219.8MB in the end (delta: -179.2MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. [2023-08-30 02:54:14,284 INFO L158 Benchmark]: Witness Printer took 3.69ms. Allocated memory is still 341.8MB. Free memory is still 219.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:54:14,285 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory is still 34.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 496.10ms. Allocated memory is still 69.2MB. Free memory was 41.7MB in the beginning and 36.8MB in the end (delta: 4.9MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.86ms. Allocated memory is still 69.2MB. Free memory was 36.8MB in the beginning and 34.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.02ms. Allocated memory is still 69.2MB. Free memory was 34.3MB in the beginning and 32.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 648.43ms. Allocated memory is still 69.2MB. Free memory was 32.6MB in the beginning and 41.3MB in the end (delta: -8.8MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13541.69ms. Allocated memory was 69.2MB in the beginning and 341.8MB in the end (delta: 272.6MB). Free memory was 40.6MB in the beginning and 219.8MB in the end (delta: -179.2MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. * Witness Printer took 3.69ms. Allocated memory is still 341.8MB. Free memory is still 219.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 125 PlacesBefore, 40 PlacesAfterwards, 117 TransitionsBefore, 31 TransitionsAfterwards, 2044 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 116 TotalNumberOfCompositions, 5120 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2643, independent: 2473, independent conditional: 0, independent unconditional: 2473, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1154, independent: 1119, independent conditional: 0, independent unconditional: 1119, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2643, independent: 1354, independent conditional: 0, independent unconditional: 1354, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 1154, unknown conditional: 0, unknown unconditional: 1154] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 89, Positive conditional cache size: 0, Positive unconditional cache size: 89, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1004; [L834] FCALL, FORK 0 pthread_create(&t1004, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1004, ((void *)0), P0, ((void *)0))=-1, t1004={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t1005; [L836] FCALL, FORK 0 pthread_create(&t1005, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1005, ((void *)0), P1, ((void *)0))=0, t1004={5:0}, t1005={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t1006; [L838] FCALL, FORK 0 pthread_create(&t1006, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1006, ((void *)0), P2, ((void *)0))=1, t1004={5:0}, t1005={6:0}, t1006={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L802] 3 z = 1 [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L808] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L762] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004={5:0}, t1005={6:0}, t1006={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: 831]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 147 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 630 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 490 mSDsluCounter, 250 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 179 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1672 IncrementalHoareTripleChecker+Invalid, 1754 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 71 mSDtfsCounter, 1672 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1218occurred in iteration=14, InterpolantAutomatonStates: 71, 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, 3.5s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 1456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:54:14,309 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/mix038.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8aba011b4454b6464ed30c6424ccbb7bc43e89a3e2bf826373810de7cb8fe97a --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:54:16,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:54:16,112 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:54:16,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:54:16,147 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:54:16,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:54:16,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:54:16,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:54:16,161 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:54:16,165 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:54:16,166 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:54:16,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:54:16,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:54:16,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:54:16,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:54:16,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:54:16,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:54:16,179 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:54:16,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:54:16,182 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:54:16,185 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:54:16,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:54:16,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:54:16,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:54:16,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:54:16,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:54:16,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:54:16,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:54:16,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:54:16,198 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:54:16,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:54:16,200 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:54:16,201 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:54:16,202 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:54:16,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:54:16,203 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:54:16,204 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:54:16,204 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:54:16,204 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:54:16,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:54:16,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:54:16,207 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:54:16,240 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:54:16,240 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:54:16,242 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:54:16,242 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:54:16,242 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:54:16,243 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:54:16,243 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:54:16,243 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:54:16,243 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:54:16,244 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:54:16,244 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:54:16,245 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:54:16,245 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:54:16,245 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:54:16,245 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:54:16,245 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:54:16,245 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:54:16,246 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:54:16,246 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:54:16,246 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:54:16,246 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 02:54:16,246 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 02:54:16,246 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:54:16,247 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:54:16,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:54:16,247 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:54:16,247 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:54:16,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:54:16,248 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:54:16,248 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:54:16,248 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 02:54:16,248 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 02:54:16,248 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:54:16,249 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:54:16,249 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:54:16,249 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 02:54:16,249 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:54:16,249 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 -> 8aba011b4454b6464ed30c6424ccbb7bc43e89a3e2bf826373810de7cb8fe97a 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:54:16,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:54:16,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:54:16,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:54:16,603 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:54:16,603 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:54:16,604 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038.opt.i [2023-08-30 02:54:17,736 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:54:18,044 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:54:18,046 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038.opt.i [2023-08-30 02:54:18,058 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1d4769df/0f477464d02744d391304aea09c07860/FLAGb1c200be7 [2023-08-30 02:54:18,069 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1d4769df/0f477464d02744d391304aea09c07860 [2023-08-30 02:54:18,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:54:18,072 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:54:18,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:54:18,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:54:18,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:54:18,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:54:18" (1/1) ... [2023-08-30 02:54:18,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@570d8506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:54:18, skipping insertion in model container [2023-08-30 02:54:18,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:54:18" (1/1) ... [2023-08-30 02:54:18,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:54:18,137 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:54:18,310 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/mix038.opt.i[944,957] [2023-08-30 02:54:18,530 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:54:18,544 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:54:18,556 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/mix038.opt.i[944,957] [2023-08-30 02:54:18,619 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:54:18,656 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:54:18,656 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:54:18,662 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:54:18,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:54:18 WrapperNode [2023-08-30 02:54:18,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:54:18,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:54:18,664 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:54:18,664 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:54:18,670 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:54:18" (1/1) ... [2023-08-30 02:54:18,705 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:54:18" (1/1) ... [2023-08-30 02:54:18,742 INFO L138 Inliner]: procedures = 179, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 137 [2023-08-30 02:54:18,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:54:18,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:54:18,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:54:18,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:54:18,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:54:18" (1/1) ... [2023-08-30 02:54:18,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:54:18" (1/1) ... [2023-08-30 02:54:18,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:54:18" (1/1) ... [2023-08-30 02:54:18,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:54:18" (1/1) ... [2023-08-30 02:54:18,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:54:18" (1/1) ... [2023-08-30 02:54:18,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:54:18" (1/1) ... [2023-08-30 02:54:18,780 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:54:18" (1/1) ... [2023-08-30 02:54:18,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:54:18" (1/1) ... [2023-08-30 02:54:18,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:54:18,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:54:18,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:54:18,786 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:54:18,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:54:18" (1/1) ... [2023-08-30 02:54:18,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:54:18,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:54:18,825 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:54:18,849 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:54:18,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:54:18,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:54:18,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:54:18,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:54:18,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 02:54:18,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 02:54:18,867 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:54:18,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:54:18,867 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:54:18,868 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:54:18,868 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:54:18,868 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:54:18,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:54:18,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:54:18,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:54:18,870 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:54:19,058 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:54:19,060 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:54:19,454 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:54:19,565 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:54:19,565 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:54:19,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:54:19 BoogieIcfgContainer [2023-08-30 02:54:19,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:54:19,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:54:19,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:54:19,572 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:54:19,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:54:18" (1/3) ... [2023-08-30 02:54:19,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d742f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:54:19, skipping insertion in model container [2023-08-30 02:54:19,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:54:18" (2/3) ... [2023-08-30 02:54:19,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d742f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:54:19, skipping insertion in model container [2023-08-30 02:54:19,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:54:19" (3/3) ... [2023-08-30 02:54:19,575 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038.opt.i [2023-08-30 02:54:19,590 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:54:19,591 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-30 02:54:19,591 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:54:19,650 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:54:19,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 257 flow [2023-08-30 02:54:19,729 INFO L130 PetriNetUnfolder]: 2/118 cut-off events. [2023-08-30 02:54:19,730 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:54:19,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-30 02:54:19,736 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 121 transitions, 257 flow [2023-08-30 02:54:19,740 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 118 transitions, 245 flow [2023-08-30 02:54:19,744 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:54:19,753 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 118 transitions, 245 flow [2023-08-30 02:54:19,755 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 118 transitions, 245 flow [2023-08-30 02:54:19,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 245 flow [2023-08-30 02:54:19,783 INFO L130 PetriNetUnfolder]: 2/118 cut-off events. [2023-08-30 02:54:19,786 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:54:19,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-30 02:54:19,789 INFO L119 LiptonReduction]: Number of co-enabled transitions 2044 [2023-08-30 02:54:25,515 INFO L134 LiptonReduction]: Checked pairs total: 5003 [2023-08-30 02:54:25,515 INFO L136 LiptonReduction]: Total number of compositions: 117 [2023-08-30 02:54:25,527 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:54:25,532 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;@456682a7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:54:25,532 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-30 02:54:25,534 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:54:25,535 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:54:25,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:25,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:54:25,536 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:54:25,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:25,539 INFO L85 PathProgramCache]: Analyzing trace with hash 510, now seen corresponding path program 1 times [2023-08-30 02:54:25,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:54:25,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126470509] [2023-08-30 02:54:25,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:25,553 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:54:25,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:54:25,565 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:54:25,572 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:54:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:25,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 02:54:25,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:54:25,632 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:54:25,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:54:25,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:54:25,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126470509] [2023-08-30 02:54:25,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1126470509] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:25,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:25,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:54:25,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229078782] [2023-08-30 02:54:25,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:25,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:54:25,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:54:25,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:54:25,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:54:25,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 238 [2023-08-30 02:54:25,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states 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:54:25,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:25,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 238 [2023-08-30 02:54:25,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:26,018 INFO L130 PetriNetUnfolder]: 910/1381 cut-off events. [2023-08-30 02:54:26,019 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2023-08-30 02:54:26,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2779 conditions, 1381 events. 910/1381 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6359 event pairs, 910 based on Foata normal form. 0/1152 useless extension candidates. Maximal degree in co-relation 2768. Up to 1362 conditions per place. [2023-08-30 02:54:26,031 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 21 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2023-08-30 02:54:26,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 99 flow [2023-08-30 02:54:26,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:54:26,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:54:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 248 transitions. [2023-08-30 02:54:26,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5210084033613446 [2023-08-30 02:54:26,043 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 248 transitions. [2023-08-30 02:54:26,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 248 transitions. [2023-08-30 02:54:26,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:26,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 248 transitions. [2023-08-30 02:54:26,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 124.0) internal successors, (248), 2 states have internal predecessors, (248), 0 states have call successors, (0), 0 states 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:54:26,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states 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:54:26,053 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states 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:54:26,054 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 2 states and 248 transitions. [2023-08-30 02:54:26,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 99 flow [2023-08-30 02:54:26,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:54:26,058 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow [2023-08-30 02:54:26,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-08-30 02:54:26,063 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2023-08-30 02:54:26,063 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow [2023-08-30 02:54:26,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states 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:54:26,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:26,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:26,075 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:54:26,275 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:54:26,276 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:54:26,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:26,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1296074815, now seen corresponding path program 1 times [2023-08-30 02:54:26,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:54:26,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357257823] [2023-08-30 02:54:26,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:26,278 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:54:26,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:54:26,279 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:54:26,285 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:54:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:26,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:54:26,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:54:26,389 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:54:26,389 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:54:26,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:54:26,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357257823] [2023-08-30 02:54:26,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357257823] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:26,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:26,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:54:26,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457970359] [2023-08-30 02:54:26,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:26,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:54:26,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:54:26,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:54:26,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:54:26,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 238 [2023-08-30 02:54:26,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:26,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:26,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 238 [2023-08-30 02:54:26,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:26,589 INFO L130 PetriNetUnfolder]: 719/1256 cut-off events. [2023-08-30 02:54:26,589 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:54:26,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2377 conditions, 1256 events. 719/1256 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6713 event pairs, 146 based on Foata normal form. 0/1159 useless extension candidates. Maximal degree in co-relation 2374. Up to 826 conditions per place. [2023-08-30 02:54:26,594 INFO L137 encePairwiseOnDemand]: 235/238 looper letters, 27 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2023-08-30 02:54:26,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 136 flow [2023-08-30 02:54:26,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:54:26,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:54:26,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2023-08-30 02:54:26,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5028011204481793 [2023-08-30 02:54:26,597 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2023-08-30 02:54:26,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2023-08-30 02:54:26,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:26,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2023-08-30 02:54:26,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states 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:54:26,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states 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:54:26,602 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states 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:54:26,602 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 359 transitions. [2023-08-30 02:54:26,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 136 flow [2023-08-30 02:54:26,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 34 transitions, 136 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:54:26,603 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-08-30 02:54:26,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-08-30 02:54:26,604 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2023-08-30 02:54:26,604 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-08-30 02:54:26,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:26,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:26,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:26,619 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:54:26,814 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:54:26,815 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:54:26,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:26,815 INFO L85 PathProgramCache]: Analyzing trace with hash 12679540, now seen corresponding path program 1 times [2023-08-30 02:54:26,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:54:26,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633466996] [2023-08-30 02:54:26,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:26,817 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:54:26,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:54:26,818 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:54:26,821 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:54:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:26,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:54:26,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:54:26,930 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:54:26,930 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:54:26,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:54:26,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633466996] [2023-08-30 02:54:26,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633466996] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:26,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:26,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:54:26,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930244833] [2023-08-30 02:54:26,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:26,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:54:26,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:54:26,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:54:26,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:54:26,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 238 [2023-08-30 02:54:26,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states 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:54:26,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:26,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 238 [2023-08-30 02:54:26,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:27,124 INFO L130 PetriNetUnfolder]: 419/710 cut-off events. [2023-08-30 02:54:27,124 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2023-08-30 02:54:27,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1497 conditions, 710 events. 419/710 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3205 event pairs, 84 based on Foata normal form. 48/724 useless extension candidates. Maximal degree in co-relation 1493. Up to 508 conditions per place. [2023-08-30 02:54:27,128 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 27 selfloop transitions, 4 changer transitions 17/51 dead transitions. [2023-08-30 02:54:27,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 51 transitions, 218 flow [2023-08-30 02:54:27,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:54:27,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:54:27,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 560 transitions. [2023-08-30 02:54:27,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2023-08-30 02:54:27,131 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 560 transitions. [2023-08-30 02:54:27,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 560 transitions. [2023-08-30 02:54:27,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:27,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 560 transitions. [2023-08-30 02:54:27,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states 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:54:27,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states 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:54:27,138 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states 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:54:27,138 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 5 states and 560 transitions. [2023-08-30 02:54:27,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 51 transitions, 218 flow [2023-08-30 02:54:27,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 51 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:54:27,140 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 86 flow [2023-08-30 02:54:27,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-08-30 02:54:27,141 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-08-30 02:54:27,141 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 86 flow [2023-08-30 02:54:27,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states 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:54:27,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:27,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:27,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-30 02:54:27,351 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:54:27,352 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:54:27,352 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:27,352 INFO L85 PathProgramCache]: Analyzing trace with hash 25201356, now seen corresponding path program 1 times [2023-08-30 02:54:27,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:54:27,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363540974] [2023-08-30 02:54:27,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:27,353 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:54:27,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:54:27,356 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:54:27,358 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:54:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:27,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:54:27,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:54:27,480 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:54:27,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:54:27,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:54:27,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [363540974] [2023-08-30 02:54:27,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [363540974] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:27,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:27,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:54:27,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047591154] [2023-08-30 02:54:27,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:27,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:54:27,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:54:27,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:54:27,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:54:27,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 238 [2023-08-30 02:54:27,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:27,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:27,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 238 [2023-08-30 02:54:27,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:27,697 INFO L130 PetriNetUnfolder]: 176/344 cut-off events. [2023-08-30 02:54:27,697 INFO L131 PetriNetUnfolder]: For 129/129 co-relation queries the response was YES. [2023-08-30 02:54:27,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 344 events. 176/344 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1341 event pairs, 37 based on Foata normal form. 30/363 useless extension candidates. Maximal degree in co-relation 935. Up to 121 conditions per place. [2023-08-30 02:54:27,699 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 34 selfloop transitions, 7 changer transitions 17/61 dead transitions. [2023-08-30 02:54:27,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 61 transitions, 318 flow [2023-08-30 02:54:27,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:54:27,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:54:27,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 672 transitions. [2023-08-30 02:54:27,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2023-08-30 02:54:27,702 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 672 transitions. [2023-08-30 02:54:27,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 672 transitions. [2023-08-30 02:54:27,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:27,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 672 transitions. [2023-08-30 02:54:27,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states 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:54:27,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states 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:54:27,708 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states 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:54:27,708 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 86 flow. Second operand 6 states and 672 transitions. [2023-08-30 02:54:27,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 61 transitions, 318 flow [2023-08-30 02:54:27,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 61 transitions, 312 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:54:27,711 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 136 flow [2023-08-30 02:54:27,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=136, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-30 02:54:27,712 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-08-30 02:54:27,712 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 136 flow [2023-08-30 02:54:27,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:27,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:27,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:27,730 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:54:27,921 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:54:27,922 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:54:27,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:27,922 INFO L85 PathProgramCache]: Analyzing trace with hash -191508252, now seen corresponding path program 1 times [2023-08-30 02:54:27,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:54:27,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882361745] [2023-08-30 02:54:27,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:27,923 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:54:27,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:54:27,924 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:54:27,927 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:54:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:28,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 02:54:28,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:54:28,072 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:54:28,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:54:28,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:54:28,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882361745] [2023-08-30 02:54:28,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882361745] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:28,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:28,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:54:28,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816200505] [2023-08-30 02:54:28,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:28,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:54:28,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:54:28,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:54:28,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:54:28,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 238 [2023-08-30 02:54:28,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 136 flow. Second operand has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states 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:54:28,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:28,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 238 [2023-08-30 02:54:28,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:28,290 INFO L130 PetriNetUnfolder]: 102/209 cut-off events. [2023-08-30 02:54:28,290 INFO L131 PetriNetUnfolder]: For 222/222 co-relation queries the response was YES. [2023-08-30 02:54:28,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 209 events. 102/209 cut-off events. For 222/222 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 692 event pairs, 32 based on Foata normal form. 9/215 useless extension candidates. Maximal degree in co-relation 629. Up to 77 conditions per place. [2023-08-30 02:54:28,291 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 31 selfloop transitions, 10 changer transitions 9/53 dead transitions. [2023-08-30 02:54:28,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 53 transitions, 320 flow [2023-08-30 02:54:28,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:54:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:54:28,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 766 transitions. [2023-08-30 02:54:28,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4597839135654262 [2023-08-30 02:54:28,294 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 766 transitions. [2023-08-30 02:54:28,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 766 transitions. [2023-08-30 02:54:28,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:28,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 766 transitions. [2023-08-30 02:54:28,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.42857142857143) internal successors, (766), 7 states have internal predecessors, (766), 0 states have call successors, (0), 0 states 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:54:28,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states 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:54:28,300 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states 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:54:28,300 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 136 flow. Second operand 7 states and 766 transitions. [2023-08-30 02:54:28,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 53 transitions, 320 flow [2023-08-30 02:54:28,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 284 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-30 02:54:28,304 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 138 flow [2023-08-30 02:54:28,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=138, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-08-30 02:54:28,305 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-08-30 02:54:28,305 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 138 flow [2023-08-30 02:54:28,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states 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:54:28,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:28,306 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:54:28,316 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:54:28,516 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:54:28,516 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:54:28,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:28,517 INFO L85 PathProgramCache]: Analyzing trace with hash -262100047, now seen corresponding path program 1 times [2023-08-30 02:54:28,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:54:28,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400913247] [2023-08-30 02:54:28,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:28,519 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:54:28,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:54:28,520 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:54:28,559 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:54:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:28,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:54:28,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:54:28,656 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:54:28,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:54:28,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:54:28,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1400913247] [2023-08-30 02:54:28,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1400913247] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:28,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:28,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:54:28,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484464697] [2023-08-30 02:54:28,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:28,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:54:28,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:54:28,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:54:28,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:54:28,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 238 [2023-08-30 02:54:28,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:28,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:28,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 238 [2023-08-30 02:54:28,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:28,797 INFO L130 PetriNetUnfolder]: 134/290 cut-off events. [2023-08-30 02:54:28,797 INFO L131 PetriNetUnfolder]: For 413/413 co-relation queries the response was YES. [2023-08-30 02:54:28,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 849 conditions, 290 events. 134/290 cut-off events. For 413/413 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1174 event pairs, 17 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 839. Up to 151 conditions per place. [2023-08-30 02:54:28,799 INFO L137 encePairwiseOnDemand]: 235/238 looper letters, 53 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-08-30 02:54:28,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 404 flow [2023-08-30 02:54:28,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:54:28,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:54:28,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 466 transitions. [2023-08-30 02:54:28,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4894957983193277 [2023-08-30 02:54:28,802 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 466 transitions. [2023-08-30 02:54:28,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 466 transitions. [2023-08-30 02:54:28,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:28,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 466 transitions. [2023-08-30 02:54:28,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states 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:54:28,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states 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:54:28,805 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states 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:54:28,806 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 138 flow. Second operand 4 states and 466 transitions. [2023-08-30 02:54:28,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 404 flow [2023-08-30 02:54:28,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 57 transitions, 324 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-08-30 02:54:28,808 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 113 flow [2023-08-30 02:54:28,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2023-08-30 02:54:28,809 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-08-30 02:54:28,809 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 113 flow [2023-08-30 02:54:28,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:28,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:28,810 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:54:28,823 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:54:29,023 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:54:29,024 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:54:29,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:29,024 INFO L85 PathProgramCache]: Analyzing trace with hash 180046069, now seen corresponding path program 2 times [2023-08-30 02:54:29,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:54:29,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666518401] [2023-08-30 02:54:29,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:54:29,025 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:54:29,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:54:29,026 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:54:29,029 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:54:29,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:54:29,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:54:29,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:54:29,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:54:29,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:54:29,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:54:29,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:54:29,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666518401] [2023-08-30 02:54:29,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666518401] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:29,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:29,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:54:29,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284081012] [2023-08-30 02:54:29,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:29,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:54:29,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:54:29,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:54:29,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:54:29,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 238 [2023-08-30 02:54:29,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 113 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:54:29,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:29,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 238 [2023-08-30 02:54:29,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:29,255 INFO L130 PetriNetUnfolder]: 229/461 cut-off events. [2023-08-30 02:54:29,255 INFO L131 PetriNetUnfolder]: For 339/339 co-relation queries the response was YES. [2023-08-30 02:54:29,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1326 conditions, 461 events. 229/461 cut-off events. For 339/339 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2049 event pairs, 95 based on Foata normal form. 1/453 useless extension candidates. Maximal degree in co-relation 1317. Up to 262 conditions per place. [2023-08-30 02:54:29,258 INFO L137 encePairwiseOnDemand]: 235/238 looper letters, 45 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-08-30 02:54:29,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 289 flow [2023-08-30 02:54:29,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:54:29,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:54:29,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-30 02:54:29,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-30 02:54:29,260 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-30 02:54:29,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-30 02:54:29,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:29,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-30 02:54:29,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states 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:54:29,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states 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:54:29,262 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states 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:54:29,263 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 113 flow. Second operand 3 states and 357 transitions. [2023-08-30 02:54:29,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 289 flow [2023-08-30 02:54:29,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:54:29,265 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 124 flow [2023-08-30 02:54:29,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-30 02:54:29,266 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2023-08-30 02:54:29,266 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 124 flow [2023-08-30 02:54:29,266 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:54:29,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:29,266 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:54:29,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-08-30 02:54:29,476 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:54:29,476 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:54:29,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:29,477 INFO L85 PathProgramCache]: Analyzing trace with hash 899615031, now seen corresponding path program 3 times [2023-08-30 02:54:29,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:54:29,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861069670] [2023-08-30 02:54:29,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:54:29,478 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:54:29,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:54:29,478 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:54:29,479 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:54:29,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 02:54:29,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 02:54:29,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:54:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:54:29,700 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 02:54:29,700 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:54:29,701 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-30 02:54:29,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-30 02:54:29,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-30 02:54:29,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-30 02:54:29,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-30 02:54:29,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-30 02:54:29,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-30 02:54:29,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-30 02:54:29,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-30 02:54:29,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-30 02:54:29,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-30 02:54:29,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-30 02:54:29,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-30 02:54:29,730 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:54:29,917 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:54:29,918 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-08-30 02:54:29,922 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:54:29,923 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:54:29,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:54:29 BasicIcfg [2023-08-30 02:54:29,976 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:54:29,977 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:54:29,977 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:54:29,977 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:54:29,977 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:54:19" (3/4) ... [2023-08-30 02:54:29,979 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:54:29,980 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:54:29,980 INFO L158 Benchmark]: Toolchain (without parser) took 11907.63ms. Allocated memory was 69.2MB in the beginning and 132.1MB in the end (delta: 62.9MB). Free memory was 44.2MB in the beginning and 83.3MB in the end (delta: -39.1MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2023-08-30 02:54:29,980 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 69.2MB. Free memory was 46.3MB in the beginning and 46.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:54:29,981 INFO L158 Benchmark]: CACSL2BoogieTranslator took 589.30ms. Allocated memory was 69.2MB in the beginning and 90.2MB in the end (delta: 21.0MB). Free memory was 44.0MB in the beginning and 58.7MB in the end (delta: -14.7MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2023-08-30 02:54:29,981 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.11ms. Allocated memory is still 90.2MB. Free memory was 58.7MB in the beginning and 56.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:54:29,981 INFO L158 Benchmark]: Boogie Preprocessor took 41.21ms. Allocated memory is still 90.2MB. Free memory was 56.2MB in the beginning and 54.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:54:29,982 INFO L158 Benchmark]: RCFGBuilder took 781.96ms. Allocated memory is still 90.2MB. Free memory was 54.1MB in the beginning and 47.5MB in the end (delta: 6.6MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2023-08-30 02:54:29,982 INFO L158 Benchmark]: TraceAbstraction took 10406.63ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 47.0MB in the beginning and 84.4MB in the end (delta: -37.3MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2023-08-30 02:54:29,982 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 132.1MB. Free memory was 84.4MB in the beginning and 83.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:54:29,985 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 69.2MB. Free memory was 46.3MB in the beginning and 46.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 589.30ms. Allocated memory was 69.2MB in the beginning and 90.2MB in the end (delta: 21.0MB). Free memory was 44.0MB in the beginning and 58.7MB in the end (delta: -14.7MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.11ms. Allocated memory is still 90.2MB. Free memory was 58.7MB in the beginning and 56.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.21ms. Allocated memory is still 90.2MB. Free memory was 56.2MB in the beginning and 54.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 781.96ms. Allocated memory is still 90.2MB. Free memory was 54.1MB in the beginning and 47.5MB in the end (delta: 6.6MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * TraceAbstraction took 10406.63ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 47.0MB in the beginning and 84.4MB in the end (delta: -37.3MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 132.1MB. Free memory was 84.4MB in the beginning and 83.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 126 PlacesBefore, 40 PlacesAfterwards, 118 TransitionsBefore, 31 TransitionsAfterwards, 2044 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 117 TotalNumberOfCompositions, 5003 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2669, independent: 2500, independent conditional: 0, independent unconditional: 2500, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1176, independent: 1140, independent conditional: 0, independent unconditional: 1140, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2669, independent: 1360, independent conditional: 0, independent unconditional: 1360, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 1176, unknown conditional: 0, unknown unconditional: 1176] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 87, Positive conditional cache size: 0, Positive unconditional cache size: 87, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1004; [L834] FCALL, FORK 0 pthread_create(&t1004, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1004, ((void *)0), P0, ((void *)0))=-1, t1004={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t1005; [L836] FCALL, FORK 0 pthread_create(&t1005, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1005, ((void *)0), P1, ((void *)0))=0, t1004={3:0}, t1005={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t1006; [L838] FCALL, FORK 0 pthread_create(&t1006, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1006, ((void *)0), P2, ((void *)0))=1, t1004={3:0}, t1005={7:0}, t1006={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 [L802] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L808] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L762] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004={3:0}, t1005={7:0}, t1006={11:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: 831]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 148 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: 10.2s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 173 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 149 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 652 IncrementalHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 4 mSDtfsCounter, 652 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=5, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 193 SizeOfPredicates, 10 NumberOfNonLiveVariables, 773 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 02:54:30,007 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