./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d8f535cb798ce58a79ec2e9a728d4e5d884025e215c7cfd9880fc53267dd5a20 --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:50:12,551 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:50:12,554 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:50:12,592 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:50:12,593 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:50:12,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:50:12,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:50:12,605 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:50:12,607 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:50:12,608 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:50:12,609 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:50:12,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:50:12,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:50:12,616 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:50:12,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:50:12,623 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:50:12,624 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:50:12,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:50:12,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:50:12,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:50:12,631 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:50:12,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:50:12,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:50:12,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:50:12,637 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:50:12,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:50:12,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:50:12,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:50:12,643 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:50:12,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:50:12,644 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:50:12,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:50:12,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:50:12,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:50:12,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:50:12,648 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:50:12,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:50:12,649 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:50:12,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:50:12,650 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:50:12,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:50:12,652 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:50:12,677 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:50:12,677 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:50:12,678 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:50:12,678 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:50:12,679 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:50:12,679 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:50:12,680 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:50:12,680 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:50:12,680 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:50:12,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:50:12,681 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:50:12,681 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:50:12,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:50:12,681 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:50:12,682 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:50:12,682 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:50:12,682 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:50:12,682 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:50:12,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:50:12,682 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:50:12,682 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:50:12,682 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:50:12,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:50:12,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:50:12,683 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:50:12,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:50:12,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:50:12,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:50:12,684 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:50:12,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:50:12,684 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:50:12,684 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:50:12,684 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:50:12,684 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:50:12,685 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 -> d8f535cb798ce58a79ec2e9a728d4e5d884025e215c7cfd9880fc53267dd5a20 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:50:12,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:50:12,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:50:12,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:50:12,983 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:50:12,983 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:50:12,984 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 02:50:14,041 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:50:14,249 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:50:14,249 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 02:50:14,263 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a74ed0372/20087b46928a4db4892d02192b10797d/FLAGa87da9e82 [2023-08-30 02:50:14,274 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a74ed0372/20087b46928a4db4892d02192b10797d [2023-08-30 02:50:14,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:50:14,277 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:50:14,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:50:14,278 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:50:14,280 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:50:14,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:50:14" (1/1) ... [2023-08-30 02:50:14,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@125f5ccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:14, skipping insertion in model container [2023-08-30 02:50:14,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:50:14" (1/1) ... [2023-08-30 02:50:14,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:50:14,319 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:50:14,424 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/mix027_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-30 02:50:14,611 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:50:14,624 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:50:14,636 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/mix027_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-30 02:50:14,683 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:50:14,732 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:50:14,732 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:50:14,737 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:50:14,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:14 WrapperNode [2023-08-30 02:50:14,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:50:14,738 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:50:14,739 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:50:14,739 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:50:14,744 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:50:14" (1/1) ... [2023-08-30 02:50:14,774 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:50:14" (1/1) ... [2023-08-30 02:50:14,798 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-08-30 02:50:14,801 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:50:14,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:50:14,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:50:14,802 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:50:14,809 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:14" (1/1) ... [2023-08-30 02:50:14,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:14" (1/1) ... [2023-08-30 02:50:14,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:14" (1/1) ... [2023-08-30 02:50:14,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:14" (1/1) ... [2023-08-30 02:50:14,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:14" (1/1) ... [2023-08-30 02:50:14,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:14" (1/1) ... [2023-08-30 02:50:14,830 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:14" (1/1) ... [2023-08-30 02:50:14,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:14" (1/1) ... [2023-08-30 02:50:14,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:50:14,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:50:14,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:50:14,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:50:14,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:14" (1/1) ... [2023-08-30 02:50:14,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:50:14,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:50:14,859 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:50:14,871 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:50:14,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:50:14,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:50:14,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:50:14,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:50:14,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:50:14,894 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:50:14,895 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:50:14,895 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:50:14,895 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:50:14,895 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:50:14,895 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:50:14,895 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:50:14,895 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:50:14,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:50:14,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:50:14,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:50:14,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:50:14,897 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:50:14,995 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:50:14,996 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:50:15,358 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:50:15,464 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:50:15,465 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:50:15,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:50:15 BoogieIcfgContainer [2023-08-30 02:50:15,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:50:15,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:50:15,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:50:15,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:50:15,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:50:14" (1/3) ... [2023-08-30 02:50:15,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739db63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:50:15, skipping insertion in model container [2023-08-30 02:50:15,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:14" (2/3) ... [2023-08-30 02:50:15,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739db63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:50:15, skipping insertion in model container [2023-08-30 02:50:15,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:50:15" (3/3) ... [2023-08-30 02:50:15,473 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 02:50:15,485 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:50:15,485 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:50:15,485 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:50:15,537 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:50:15,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 304 flow [2023-08-30 02:50:15,637 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2023-08-30 02:50:15,637 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:50:15,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-30 02:50:15,642 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 142 transitions, 304 flow [2023-08-30 02:50:15,649 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 138 transitions, 288 flow [2023-08-30 02:50:15,652 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:50:15,667 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 138 transitions, 288 flow [2023-08-30 02:50:15,672 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 138 transitions, 288 flow [2023-08-30 02:50:15,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 288 flow [2023-08-30 02:50:15,702 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2023-08-30 02:50:15,704 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:50:15,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-30 02:50:15,707 INFO L119 LiptonReduction]: Number of co-enabled transitions 3524 [2023-08-30 02:50:18,963 INFO L134 LiptonReduction]: Checked pairs total: 10664 [2023-08-30 02:50:18,963 INFO L136 LiptonReduction]: Total number of compositions: 128 [2023-08-30 02:50:18,978 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:50:18,997 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;@68472582, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:50:18,998 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:50:18,999 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:50:19,000 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:50:19,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:19,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:50:19,001 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:19,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:19,004 INFO L85 PathProgramCache]: Analyzing trace with hash 599, now seen corresponding path program 1 times [2023-08-30 02:50:19,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:19,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468713162] [2023-08-30 02:50:19,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:19,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:19,086 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:50:19,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:19,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468713162] [2023-08-30 02:50:19,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468713162] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:19,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:19,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:50:19,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932386429] [2023-08-30 02:50:19,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:19,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:50:19,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:19,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:50:19,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:50:19,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 270 [2023-08-30 02:50:19,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states 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:50:19,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:19,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 270 [2023-08-30 02:50:19,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:20,188 INFO L130 PetriNetUnfolder]: 8719/11826 cut-off events. [2023-08-30 02:50:20,189 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2023-08-30 02:50:20,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23774 conditions, 11826 events. 8719/11826 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 61328 event pairs, 8719 based on Foata normal form. 0/10334 useless extension candidates. Maximal degree in co-relation 23762. Up to 11731 conditions per place. [2023-08-30 02:50:20,296 INFO L137 encePairwiseOnDemand]: 261/270 looper letters, 28 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-08-30 02:50:20,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 132 flow [2023-08-30 02:50:20,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:50:20,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:50:20,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 291 transitions. [2023-08-30 02:50:20,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5388888888888889 [2023-08-30 02:50:20,320 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 291 transitions. [2023-08-30 02:50:20,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 291 transitions. [2023-08-30 02:50:20,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:20,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 291 transitions. [2023-08-30 02:50:20,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 states 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:50:20,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 0 states 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:50:20,345 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 0 states 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:50:20,347 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 291 transitions. [2023-08-30 02:50:20,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 132 flow [2023-08-30 02:50:20,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:50:20,354 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-08-30 02:50:20,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-30 02:50:20,364 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-30 02:50:20,364 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-08-30 02:50:20,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states 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:50:20,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:20,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:50:20,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:50:20,366 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:20,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:20,366 INFO L85 PathProgramCache]: Analyzing trace with hash 587660, now seen corresponding path program 1 times [2023-08-30 02:50:20,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:20,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442105239] [2023-08-30 02:50:20,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:20,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:20,657 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:50:20,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:20,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442105239] [2023-08-30 02:50:20,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442105239] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:20,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:20,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:50:20,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910471098] [2023-08-30 02:50:20,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:20,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:50:20,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:20,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:50:20,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:50:20,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 270 [2023-08-30 02:50:20,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states 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:50:20,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:20,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 270 [2023-08-30 02:50:20,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:21,615 INFO L130 PetriNetUnfolder]: 6855/9885 cut-off events. [2023-08-30 02:50:21,615 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:50:21,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19322 conditions, 9885 events. 6855/9885 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 60258 event pairs, 1263 based on Foata normal form. 0/9227 useless extension candidates. Maximal degree in co-relation 19319. Up to 7399 conditions per place. [2023-08-30 02:50:21,662 INFO L137 encePairwiseOnDemand]: 267/270 looper letters, 45 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2023-08-30 02:50:21,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 218 flow [2023-08-30 02:50:21,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:50:21,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:50:21,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2023-08-30 02:50:21,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.528395061728395 [2023-08-30 02:50:21,667 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2023-08-30 02:50:21,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2023-08-30 02:50:21,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:21,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2023-08-30 02:50:21,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states 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:50:21,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states 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:50:21,673 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states 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:50:21,673 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 428 transitions. [2023-08-30 02:50:21,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 218 flow [2023-08-30 02:50:21,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:50:21,674 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-08-30 02:50:21,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-30 02:50:21,675 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-08-30 02:50:21,675 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-08-30 02:50:21,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states 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:50:21,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:21,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:21,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:50:21,676 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:21,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:21,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1898026173, now seen corresponding path program 1 times [2023-08-30 02:50:21,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:21,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794986929] [2023-08-30 02:50:21,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:21,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:21,971 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:50:21,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:21,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794986929] [2023-08-30 02:50:21,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794986929] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:21,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:21,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:50:21,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494848953] [2023-08-30 02:50:21,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:21,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:50:21,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:21,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:50:21,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:50:21,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 270 [2023-08-30 02:50:21,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states 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:50:21,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:21,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 270 [2023-08-30 02:50:21,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:22,821 INFO L130 PetriNetUnfolder]: 7415/10045 cut-off events. [2023-08-30 02:50:22,822 INFO L131 PetriNetUnfolder]: For 649/649 co-relation queries the response was YES. [2023-08-30 02:50:22,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20886 conditions, 10045 events. 7415/10045 cut-off events. For 649/649 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 50543 event pairs, 1655 based on Foata normal form. 0/9765 useless extension candidates. Maximal degree in co-relation 20882. Up to 5057 conditions per place. [2023-08-30 02:50:22,878 INFO L137 encePairwiseOnDemand]: 265/270 looper letters, 59 selfloop transitions, 5 changer transitions 0/67 dead transitions. [2023-08-30 02:50:22,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 67 transitions, 280 flow [2023-08-30 02:50:22,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:50:22,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:50:22,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 686 transitions. [2023-08-30 02:50:22,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5081481481481481 [2023-08-30 02:50:22,881 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 686 transitions. [2023-08-30 02:50:22,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 686 transitions. [2023-08-30 02:50:22,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:22,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 686 transitions. [2023-08-30 02:50:22,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 states 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:50:22,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states 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:50:22,886 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states 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:50:22,886 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 5 states and 686 transitions. [2023-08-30 02:50:22,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 67 transitions, 280 flow [2023-08-30 02:50:22,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 67 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:50:22,889 INFO L231 Difference]: Finished difference. Result has 48 places, 33 transitions, 102 flow [2023-08-30 02:50:22,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2023-08-30 02:50:22,890 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2023-08-30 02:50:22,892 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 102 flow [2023-08-30 02:50:22,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states 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:50:22,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:22,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:22,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:50:22,894 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:22,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:22,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1898026224, now seen corresponding path program 1 times [2023-08-30 02:50:22,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:22,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850297196] [2023-08-30 02:50:22,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:22,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:23,345 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:50:23,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:23,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850297196] [2023-08-30 02:50:23,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850297196] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:23,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:23,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:50:23,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867952623] [2023-08-30 02:50:23,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:23,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:50:23,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:23,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:50:23,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:50:23,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 270 [2023-08-30 02:50:23,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 102 flow. Second operand has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states 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:50:23,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:23,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 270 [2023-08-30 02:50:23,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:24,154 INFO L130 PetriNetUnfolder]: 5271/7347 cut-off events. [2023-08-30 02:50:24,155 INFO L131 PetriNetUnfolder]: For 1664/1664 co-relation queries the response was YES. [2023-08-30 02:50:24,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15974 conditions, 7347 events. 5271/7347 cut-off events. For 1664/1664 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 37530 event pairs, 1864 based on Foata normal form. 576/7891 useless extension candidates. Maximal degree in co-relation 15967. Up to 6992 conditions per place. [2023-08-30 02:50:24,186 INFO L137 encePairwiseOnDemand]: 265/270 looper letters, 39 selfloop transitions, 4 changer transitions 2/49 dead transitions. [2023-08-30 02:50:24,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 216 flow [2023-08-30 02:50:24,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:50:24,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:50:24,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 692 transitions. [2023-08-30 02:50:24,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4271604938271605 [2023-08-30 02:50:24,189 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 692 transitions. [2023-08-30 02:50:24,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 692 transitions. [2023-08-30 02:50:24,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:24,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 692 transitions. [2023-08-30 02:50:24,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states 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:50:24,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 270.0) internal successors, (1890), 7 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states 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:50:24,194 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 270.0) internal successors, (1890), 7 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states 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:50:24,194 INFO L175 Difference]: Start difference. First operand has 48 places, 33 transitions, 102 flow. Second operand 6 states and 692 transitions. [2023-08-30 02:50:24,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 216 flow [2023-08-30 02:50:24,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 49 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:50:24,219 INFO L231 Difference]: Finished difference. Result has 50 places, 29 transitions, 84 flow [2023-08-30 02:50:24,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=84, PETRI_PLACES=50, PETRI_TRANSITIONS=29} [2023-08-30 02:50:24,219 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2023-08-30 02:50:24,220 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 29 transitions, 84 flow [2023-08-30 02:50:24,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states 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:50:24,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:24,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:24,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:50:24,221 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:24,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:24,221 INFO L85 PathProgramCache]: Analyzing trace with hash -2054696068, now seen corresponding path program 1 times [2023-08-30 02:50:24,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:24,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450371326] [2023-08-30 02:50:24,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:24,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:24,347 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:50:24,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:24,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450371326] [2023-08-30 02:50:24,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450371326] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:24,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:24,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:50:24,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162399507] [2023-08-30 02:50:24,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:24,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:50:24,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:24,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:50:24,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:50:24,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 270 [2023-08-30 02:50:24,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 29 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states 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:50:24,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:24,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 270 [2023-08-30 02:50:24,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:26,085 INFO L130 PetriNetUnfolder]: 19519/26554 cut-off events. [2023-08-30 02:50:26,085 INFO L131 PetriNetUnfolder]: For 5117/5117 co-relation queries the response was YES. [2023-08-30 02:50:26,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57104 conditions, 26554 events. 19519/26554 cut-off events. For 5117/5117 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 146150 event pairs, 1735 based on Foata normal form. 881/27435 useless extension candidates. Maximal degree in co-relation 57097. Up to 13430 conditions per place. [2023-08-30 02:50:26,157 INFO L137 encePairwiseOnDemand]: 260/270 looper letters, 63 selfloop transitions, 10 changer transitions 42/115 dead transitions. [2023-08-30 02:50:26,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 115 transitions, 518 flow [2023-08-30 02:50:26,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:50:26,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:50:26,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 923 transitions. [2023-08-30 02:50:26,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4883597883597884 [2023-08-30 02:50:26,160 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 923 transitions. [2023-08-30 02:50:26,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 923 transitions. [2023-08-30 02:50:26,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:26,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 923 transitions. [2023-08-30 02:50:26,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.85714285714286) internal successors, (923), 7 states have internal predecessors, (923), 0 states have call successors, (0), 0 states 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:50:26,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 270.0) internal successors, (2160), 8 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states 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:50:26,165 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 270.0) internal successors, (2160), 8 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states 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:50:26,165 INFO L175 Difference]: Start difference. First operand has 50 places, 29 transitions, 84 flow. Second operand 7 states and 923 transitions. [2023-08-30 02:50:26,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 115 transitions, 518 flow [2023-08-30 02:50:26,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 115 transitions, 491 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-08-30 02:50:26,284 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 160 flow [2023-08-30 02:50:26,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=160, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2023-08-30 02:50:26,285 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2023-08-30 02:50:26,285 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 160 flow [2023-08-30 02:50:26,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states 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:50:26,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:26,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:26,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:50:26,285 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:26,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:26,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1183325790, now seen corresponding path program 1 times [2023-08-30 02:50:26,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:26,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406744369] [2023-08-30 02:50:26,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:26,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:26,410 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:50:26,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:26,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406744369] [2023-08-30 02:50:26,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406744369] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:26,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:26,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:50:26,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39238154] [2023-08-30 02:50:26,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:26,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:50:26,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:26,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:50:26,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:50:26,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 270 [2023-08-30 02:50:26,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states 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:50:26,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:26,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 270 [2023-08-30 02:50:26,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:28,105 INFO L130 PetriNetUnfolder]: 10326/15124 cut-off events. [2023-08-30 02:50:28,105 INFO L131 PetriNetUnfolder]: For 9181/10199 co-relation queries the response was YES. [2023-08-30 02:50:28,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38202 conditions, 15124 events. 10326/15124 cut-off events. For 9181/10199 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 94264 event pairs, 1885 based on Foata normal form. 1105/15781 useless extension candidates. Maximal degree in co-relation 38192. Up to 9878 conditions per place. [2023-08-30 02:50:28,191 INFO L137 encePairwiseOnDemand]: 263/270 looper letters, 77 selfloop transitions, 10 changer transitions 0/96 dead transitions. [2023-08-30 02:50:28,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 96 transitions, 529 flow [2023-08-30 02:50:28,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:50:28,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:50:28,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 678 transitions. [2023-08-30 02:50:28,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5022222222222222 [2023-08-30 02:50:28,194 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 678 transitions. [2023-08-30 02:50:28,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 678 transitions. [2023-08-30 02:50:28,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:28,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 678 transitions. [2023-08-30 02:50:28,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 0 states have call successors, (0), 0 states 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:50:28,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states 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:50:28,197 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states 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:50:28,198 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 160 flow. Second operand 5 states and 678 transitions. [2023-08-30 02:50:28,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 96 transitions, 529 flow [2023-08-30 02:50:28,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 96 transitions, 527 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 02:50:28,210 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 233 flow [2023-08-30 02:50:28,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=233, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-08-30 02:50:28,212 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2023-08-30 02:50:28,213 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 233 flow [2023-08-30 02:50:28,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states 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:50:28,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:28,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:28,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:50:28,216 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:28,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:28,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1742313102, now seen corresponding path program 1 times [2023-08-30 02:50:28,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:28,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816048988] [2023-08-30 02:50:28,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:28,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:28,410 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:50:28,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:28,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816048988] [2023-08-30 02:50:28,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816048988] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:28,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:28,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:50:28,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241106265] [2023-08-30 02:50:28,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:28,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:50:28,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:28,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:50:28,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:50:28,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 270 [2023-08-30 02:50:28,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states 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:50:28,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:28,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 270 [2023-08-30 02:50:28,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:30,431 INFO L130 PetriNetUnfolder]: 15998/23656 cut-off events. [2023-08-30 02:50:30,431 INFO L131 PetriNetUnfolder]: For 24989/25857 co-relation queries the response was YES. [2023-08-30 02:50:30,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75428 conditions, 23656 events. 15998/23656 cut-off events. For 24989/25857 co-relation queries the response was YES. Maximal size of possible extension queue 1013. Compared 158563 event pairs, 6603 based on Foata normal form. 643/23396 useless extension candidates. Maximal degree in co-relation 75415. Up to 11066 conditions per place. [2023-08-30 02:50:30,542 INFO L137 encePairwiseOnDemand]: 266/270 looper letters, 64 selfloop transitions, 5 changer transitions 28/103 dead transitions. [2023-08-30 02:50:30,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 103 transitions, 678 flow [2023-08-30 02:50:30,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:50:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:50:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 686 transitions. [2023-08-30 02:50:30,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5081481481481481 [2023-08-30 02:50:30,545 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 686 transitions. [2023-08-30 02:50:30,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 686 transitions. [2023-08-30 02:50:30,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:30,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 686 transitions. [2023-08-30 02:50:30,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 states 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:50:30,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states 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:50:30,548 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states 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:50:30,548 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 233 flow. Second operand 5 states and 686 transitions. [2023-08-30 02:50:30,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 103 transitions, 678 flow [2023-08-30 02:50:30,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 103 transitions, 669 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:50:30,605 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 249 flow [2023-08-30 02:50:30,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2023-08-30 02:50:30,605 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2023-08-30 02:50:30,606 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 249 flow [2023-08-30 02:50:30,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states 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:50:30,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:30,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:30,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:50:30,606 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:30,607 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:30,607 INFO L85 PathProgramCache]: Analyzing trace with hash -56613651, now seen corresponding path program 1 times [2023-08-30 02:50:30,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:30,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017617917] [2023-08-30 02:50:30,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:30,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:30,850 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:50:30,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:30,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017617917] [2023-08-30 02:50:30,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017617917] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:30,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:30,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:50:30,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770377534] [2023-08-30 02:50:30,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:30,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:50:30,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:30,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:50:30,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:50:30,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 270 [2023-08-30 02:50:30,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 47 transitions, 249 flow. Second operand has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 states 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:50:30,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:30,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 270 [2023-08-30 02:50:30,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:32,194 INFO L130 PetriNetUnfolder]: 10780/16315 cut-off events. [2023-08-30 02:50:32,195 INFO L131 PetriNetUnfolder]: For 16433/17541 co-relation queries the response was YES. [2023-08-30 02:50:32,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51675 conditions, 16315 events. 10780/16315 cut-off events. For 16433/17541 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 110015 event pairs, 1319 based on Foata normal form. 1148/16905 useless extension candidates. Maximal degree in co-relation 51659. Up to 5219 conditions per place. [2023-08-30 02:50:32,262 INFO L137 encePairwiseOnDemand]: 263/270 looper letters, 107 selfloop transitions, 19 changer transitions 0/135 dead transitions. [2023-08-30 02:50:32,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 135 transitions, 889 flow [2023-08-30 02:50:32,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:50:32,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:50:32,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 951 transitions. [2023-08-30 02:50:32,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5031746031746032 [2023-08-30 02:50:32,265 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 951 transitions. [2023-08-30 02:50:32,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 951 transitions. [2023-08-30 02:50:32,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:32,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 951 transitions. [2023-08-30 02:50:32,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.85714285714286) internal successors, (951), 7 states have internal predecessors, (951), 0 states have call successors, (0), 0 states 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:50:32,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 270.0) internal successors, (2160), 8 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states 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:50:32,269 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 270.0) internal successors, (2160), 8 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states 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:50:32,269 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 249 flow. Second operand 7 states and 951 transitions. [2023-08-30 02:50:32,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 135 transitions, 889 flow [2023-08-30 02:50:32,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 135 transitions, 870 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-30 02:50:32,334 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 374 flow [2023-08-30 02:50:32,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=374, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2023-08-30 02:50:32,335 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 13 predicate places. [2023-08-30 02:50:32,335 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 374 flow [2023-08-30 02:50:32,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 states 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:50:32,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:32,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:32,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:50:32,336 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:32,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:32,336 INFO L85 PathProgramCache]: Analyzing trace with hash -911685265, now seen corresponding path program 1 times [2023-08-30 02:50:32,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:32,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108857547] [2023-08-30 02:50:32,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:32,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:32,511 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:50:32,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:32,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108857547] [2023-08-30 02:50:32,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108857547] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:32,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:32,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:50:32,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682933710] [2023-08-30 02:50:32,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:32,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:50:32,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:32,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:50:32,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:50:32,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 270 [2023-08-30 02:50:32,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 374 flow. Second operand has 6 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states 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:50:32,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:32,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 270 [2023-08-30 02:50:32,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:33,906 INFO L130 PetriNetUnfolder]: 9842/14879 cut-off events. [2023-08-30 02:50:33,907 INFO L131 PetriNetUnfolder]: For 25162/26192 co-relation queries the response was YES. [2023-08-30 02:50:33,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54771 conditions, 14879 events. 9842/14879 cut-off events. For 25162/26192 co-relation queries the response was YES. Maximal size of possible extension queue 827. Compared 100068 event pairs, 1053 based on Foata normal form. 517/14852 useless extension candidates. Maximal degree in co-relation 54754. Up to 4896 conditions per place. [2023-08-30 02:50:33,954 INFO L137 encePairwiseOnDemand]: 263/270 looper letters, 119 selfloop transitions, 28 changer transitions 14/170 dead transitions. [2023-08-30 02:50:33,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 170 transitions, 1227 flow [2023-08-30 02:50:33,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 02:50:33,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 02:50:33,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1222 transitions. [2023-08-30 02:50:33,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502880658436214 [2023-08-30 02:50:33,957 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1222 transitions. [2023-08-30 02:50:33,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1222 transitions. [2023-08-30 02:50:33,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:33,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1222 transitions. [2023-08-30 02:50:33,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 135.77777777777777) internal successors, (1222), 9 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states 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:50:33,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 270.0) internal successors, (2700), 10 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states 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:50:33,963 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 270.0) internal successors, (2700), 10 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states 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:50:33,963 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 374 flow. Second operand 9 states and 1222 transitions. [2023-08-30 02:50:33,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 170 transitions, 1227 flow [2023-08-30 02:50:34,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 170 transitions, 1165 flow, removed 19 selfloop flow, removed 4 redundant places. [2023-08-30 02:50:34,724 INFO L231 Difference]: Finished difference. Result has 73 places, 65 transitions, 495 flow [2023-08-30 02:50:34,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=495, PETRI_PLACES=73, PETRI_TRANSITIONS=65} [2023-08-30 02:50:34,725 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 20 predicate places. [2023-08-30 02:50:34,725 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 65 transitions, 495 flow [2023-08-30 02:50:34,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states 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:50:34,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:34,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:34,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:50:34,726 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:34,726 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:34,726 INFO L85 PathProgramCache]: Analyzing trace with hash 3496099, now seen corresponding path program 1 times [2023-08-30 02:50:34,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:34,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148485236] [2023-08-30 02:50:34,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:34,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:35,222 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:50:35,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:35,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148485236] [2023-08-30 02:50:35,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148485236] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:35,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:35,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:50:35,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668215731] [2023-08-30 02:50:35,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:35,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:50:35,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:35,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:50:35,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:50:35,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 270 [2023-08-30 02:50:35,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 65 transitions, 495 flow. Second operand has 7 states, 7 states have (on average 114.57142857142857) internal successors, (802), 7 states have internal predecessors, (802), 0 states have call successors, (0), 0 states 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:50:35,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:35,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 270 [2023-08-30 02:50:35,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:38,165 INFO L130 PetriNetUnfolder]: 21754/31780 cut-off events. [2023-08-30 02:50:38,165 INFO L131 PetriNetUnfolder]: For 90521/90521 co-relation queries the response was YES. [2023-08-30 02:50:38,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123606 conditions, 31780 events. 21754/31780 cut-off events. For 90521/90521 co-relation queries the response was YES. Maximal size of possible extension queue 1298. Compared 209581 event pairs, 1019 based on Foata normal form. 17/31797 useless extension candidates. Maximal degree in co-relation 123587. Up to 10243 conditions per place. [2023-08-30 02:50:38,337 INFO L137 encePairwiseOnDemand]: 254/270 looper letters, 185 selfloop transitions, 67 changer transitions 146/398 dead transitions. [2023-08-30 02:50:38,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 398 transitions, 3841 flow [2023-08-30 02:50:38,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 02:50:38,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 02:50:38,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1419 transitions. [2023-08-30 02:50:38,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2023-08-30 02:50:38,340 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1419 transitions. [2023-08-30 02:50:38,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1419 transitions. [2023-08-30 02:50:38,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:38,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1419 transitions. [2023-08-30 02:50:38,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 129.0) internal successors, (1419), 11 states have internal predecessors, (1419), 0 states have call successors, (0), 0 states 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:50:38,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 270.0) internal successors, (3240), 12 states have internal predecessors, (3240), 0 states have call successors, (0), 0 states 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:50:38,346 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 270.0) internal successors, (3240), 12 states have internal predecessors, (3240), 0 states have call successors, (0), 0 states 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:50:38,347 INFO L175 Difference]: Start difference. First operand has 73 places, 65 transitions, 495 flow. Second operand 11 states and 1419 transitions. [2023-08-30 02:50:38,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 398 transitions, 3841 flow [2023-08-30 02:50:41,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 398 transitions, 3146 flow, removed 247 selfloop flow, removed 5 redundant places. [2023-08-30 02:50:41,674 INFO L231 Difference]: Finished difference. Result has 88 places, 111 transitions, 971 flow [2023-08-30 02:50:41,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=971, PETRI_PLACES=88, PETRI_TRANSITIONS=111} [2023-08-30 02:50:41,675 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 35 predicate places. [2023-08-30 02:50:41,675 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 111 transitions, 971 flow [2023-08-30 02:50:41,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.57142857142857) internal successors, (802), 7 states have internal predecessors, (802), 0 states have call successors, (0), 0 states 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:50:41,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:41,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:41,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:50:41,676 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:41,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:41,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1559103871, now seen corresponding path program 2 times [2023-08-30 02:50:41,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:41,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448883552] [2023-08-30 02:50:41,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:41,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:42,437 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:50:42,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:42,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448883552] [2023-08-30 02:50:42,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448883552] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:42,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:42,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:50:42,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904286485] [2023-08-30 02:50:42,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:42,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:50:42,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:42,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:50:42,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:50:42,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 270 [2023-08-30 02:50:42,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 111 transitions, 971 flow. Second operand has 8 states, 8 states have (on average 114.125) internal successors, (913), 8 states have internal predecessors, (913), 0 states have call successors, (0), 0 states 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:50:42,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:42,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 270 [2023-08-30 02:50:42,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:44,464 INFO L130 PetriNetUnfolder]: 10155/15537 cut-off events. [2023-08-30 02:50:44,465 INFO L131 PetriNetUnfolder]: For 64967/64967 co-relation queries the response was YES. [2023-08-30 02:50:44,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75948 conditions, 15537 events. 10155/15537 cut-off events. For 64967/64967 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 98347 event pairs, 794 based on Foata normal form. 17/15554 useless extension candidates. Maximal degree in co-relation 75920. Up to 4349 conditions per place. [2023-08-30 02:50:44,627 INFO L137 encePairwiseOnDemand]: 256/270 looper letters, 217 selfloop transitions, 74 changer transitions 30/321 dead transitions. [2023-08-30 02:50:44,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 321 transitions, 3264 flow [2023-08-30 02:50:44,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 02:50:44,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 02:50:44,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1411 transitions. [2023-08-30 02:50:44,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4750841750841751 [2023-08-30 02:50:44,631 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1411 transitions. [2023-08-30 02:50:44,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1411 transitions. [2023-08-30 02:50:44,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:44,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1411 transitions. [2023-08-30 02:50:44,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 128.27272727272728) internal successors, (1411), 11 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states 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:50:44,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 270.0) internal successors, (3240), 12 states have internal predecessors, (3240), 0 states have call successors, (0), 0 states 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:50:44,637 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 270.0) internal successors, (3240), 12 states have internal predecessors, (3240), 0 states have call successors, (0), 0 states 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:50:44,637 INFO L175 Difference]: Start difference. First operand has 88 places, 111 transitions, 971 flow. Second operand 11 states and 1411 transitions. [2023-08-30 02:50:44,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 321 transitions, 3264 flow [2023-08-30 02:50:45,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 321 transitions, 3066 flow, removed 99 selfloop flow, removed 7 redundant places. [2023-08-30 02:50:45,167 INFO L231 Difference]: Finished difference. Result has 89 places, 132 transitions, 1391 flow [2023-08-30 02:50:45,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1391, PETRI_PLACES=89, PETRI_TRANSITIONS=132} [2023-08-30 02:50:45,168 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 36 predicate places. [2023-08-30 02:50:45,168 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 132 transitions, 1391 flow [2023-08-30 02:50:45,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.125) internal successors, (913), 8 states have internal predecessors, (913), 0 states have call successors, (0), 0 states 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:50:45,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:45,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:45,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 02:50:45,169 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:45,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:45,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1235428605, now seen corresponding path program 3 times [2023-08-30 02:50:45,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:45,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666278293] [2023-08-30 02:50:45,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:45,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:45,520 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:50:45,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:45,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666278293] [2023-08-30 02:50:45,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666278293] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:45,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:45,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:50:45,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498178784] [2023-08-30 02:50:45,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:45,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:50:45,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:45,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:50:45,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:50:45,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 270 [2023-08-30 02:50:45,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 132 transitions, 1391 flow. Second operand has 7 states, 7 states have (on average 114.57142857142857) internal successors, (802), 7 states have internal predecessors, (802), 0 states have call successors, (0), 0 states 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:50:45,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:45,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 270 [2023-08-30 02:50:45,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:47,580 INFO L130 PetriNetUnfolder]: 10687/16518 cut-off events. [2023-08-30 02:50:47,580 INFO L131 PetriNetUnfolder]: For 91955/91955 co-relation queries the response was YES. [2023-08-30 02:50:47,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88804 conditions, 16518 events. 10687/16518 cut-off events. For 91955/91955 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 107581 event pairs, 1646 based on Foata normal form. 14/16532 useless extension candidates. Maximal degree in co-relation 88776. Up to 6494 conditions per place. [2023-08-30 02:50:47,653 INFO L137 encePairwiseOnDemand]: 254/270 looper letters, 152 selfloop transitions, 75 changer transitions 82/309 dead transitions. [2023-08-30 02:50:47,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 309 transitions, 3267 flow [2023-08-30 02:50:47,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 02:50:47,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 02:50:47,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1289 transitions. [2023-08-30 02:50:47,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4774074074074074 [2023-08-30 02:50:47,685 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1289 transitions. [2023-08-30 02:50:47,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1289 transitions. [2023-08-30 02:50:47,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:47,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1289 transitions. [2023-08-30 02:50:47,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 128.9) internal successors, (1289), 10 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states 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:50:47,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 270.0) internal successors, (2970), 11 states have internal predecessors, (2970), 0 states have call successors, (0), 0 states 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:50:47,691 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 270.0) internal successors, (2970), 11 states have internal predecessors, (2970), 0 states have call successors, (0), 0 states 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:50:47,691 INFO L175 Difference]: Start difference. First operand has 89 places, 132 transitions, 1391 flow. Second operand 10 states and 1289 transitions. [2023-08-30 02:50:47,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 309 transitions, 3267 flow [2023-08-30 02:50:48,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 309 transitions, 3210 flow, removed 17 selfloop flow, removed 4 redundant places. [2023-08-30 02:50:48,412 INFO L231 Difference]: Finished difference. Result has 94 places, 124 transitions, 1420 flow [2023-08-30 02:50:48,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=1360, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1420, PETRI_PLACES=94, PETRI_TRANSITIONS=124} [2023-08-30 02:50:48,412 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 41 predicate places. [2023-08-30 02:50:48,413 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 124 transitions, 1420 flow [2023-08-30 02:50:48,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.57142857142857) internal successors, (802), 7 states have internal predecessors, (802), 0 states have call successors, (0), 0 states 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:50:48,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:48,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:48,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 02:50:48,413 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:48,414 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:48,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1845487983, now seen corresponding path program 4 times [2023-08-30 02:50:48,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:48,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910510051] [2023-08-30 02:50:48,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:48,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:48,599 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:50:48,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:48,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910510051] [2023-08-30 02:50:48,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910510051] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:48,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:48,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:50:48,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798716357] [2023-08-30 02:50:48,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:48,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:50:48,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:48,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:50:48,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:50:48,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 270 [2023-08-30 02:50:48,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 124 transitions, 1420 flow. Second operand has 7 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 states have internal predecessors, (869), 0 states have call successors, (0), 0 states 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:50:48,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:48,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 270 [2023-08-30 02:50:48,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:49,908 INFO L130 PetriNetUnfolder]: 7367/11780 cut-off events. [2023-08-30 02:50:49,908 INFO L131 PetriNetUnfolder]: For 78865/80673 co-relation queries the response was YES. [2023-08-30 02:50:49,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63068 conditions, 11780 events. 7367/11780 cut-off events. For 78865/80673 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 82141 event pairs, 811 based on Foata normal form. 884/12422 useless extension candidates. Maximal degree in co-relation 63039. Up to 4629 conditions per place. [2023-08-30 02:50:49,995 INFO L137 encePairwiseOnDemand]: 263/270 looper letters, 175 selfloop transitions, 18 changer transitions 83/304 dead transitions. [2023-08-30 02:50:49,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 304 transitions, 3983 flow [2023-08-30 02:50:49,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:50:49,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:50:49,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1060 transitions. [2023-08-30 02:50:49,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49074074074074076 [2023-08-30 02:50:49,997 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1060 transitions. [2023-08-30 02:50:49,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1060 transitions. [2023-08-30 02:50:49,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:49,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1060 transitions. [2023-08-30 02:50:49,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 132.5) internal successors, (1060), 8 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:50,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 270.0) internal successors, (2430), 9 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states 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:50:50,002 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 270.0) internal successors, (2430), 9 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states 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:50:50,002 INFO L175 Difference]: Start difference. First operand has 94 places, 124 transitions, 1420 flow. Second operand 8 states and 1060 transitions. [2023-08-30 02:50:50,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 304 transitions, 3983 flow [2023-08-30 02:50:50,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 304 transitions, 3572 flow, removed 17 selfloop flow, removed 9 redundant places. [2023-08-30 02:50:50,934 INFO L231 Difference]: Finished difference. Result has 92 places, 108 transitions, 1118 flow [2023-08-30 02:50:50,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1118, PETRI_PLACES=92, PETRI_TRANSITIONS=108} [2023-08-30 02:50:50,935 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 39 predicate places. [2023-08-30 02:50:50,935 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 108 transitions, 1118 flow [2023-08-30 02:50:50,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 states have internal predecessors, (869), 0 states have call successors, (0), 0 states 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:50:50,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:50,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:50,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 02:50:50,935 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:50,935 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:50,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1727918582, now seen corresponding path program 1 times [2023-08-30 02:50:50,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:50,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794785517] [2023-08-30 02:50:50,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:50,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:51,171 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:50:51,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:51,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794785517] [2023-08-30 02:50:51,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794785517] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:51,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:51,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:50:51,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538223012] [2023-08-30 02:50:51,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:51,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:50:51,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:51,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:50:51,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:50:51,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 270 [2023-08-30 02:50:51,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 108 transitions, 1118 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states 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:50:51,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:51,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 270 [2023-08-30 02:50:51,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:51,850 INFO L130 PetriNetUnfolder]: 4205/6505 cut-off events. [2023-08-30 02:50:51,850 INFO L131 PetriNetUnfolder]: For 41330/41330 co-relation queries the response was YES. [2023-08-30 02:50:51,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37110 conditions, 6505 events. 4205/6505 cut-off events. For 41330/41330 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 36293 event pairs, 429 based on Foata normal form. 2/6507 useless extension candidates. Maximal degree in co-relation 37081. Up to 3363 conditions per place. [2023-08-30 02:50:51,879 INFO L137 encePairwiseOnDemand]: 259/270 looper letters, 83 selfloop transitions, 37 changer transitions 90/210 dead transitions. [2023-08-30 02:50:51,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 210 transitions, 2500 flow [2023-08-30 02:50:51,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:50:51,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:50:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 760 transitions. [2023-08-30 02:50:51,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2023-08-30 02:50:51,881 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 760 transitions. [2023-08-30 02:50:51,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 760 transitions. [2023-08-30 02:50:51,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:51,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 760 transitions. [2023-08-30 02:50:51,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:51,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 270.0) internal successors, (1890), 7 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states 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:50:51,885 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 270.0) internal successors, (1890), 7 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states 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:50:51,885 INFO L175 Difference]: Start difference. First operand has 92 places, 108 transitions, 1118 flow. Second operand 6 states and 760 transitions. [2023-08-30 02:50:51,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 210 transitions, 2500 flow [2023-08-30 02:50:52,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 210 transitions, 2274 flow, removed 57 selfloop flow, removed 10 redundant places. [2023-08-30 02:50:52,005 INFO L231 Difference]: Finished difference. Result has 89 places, 89 transitions, 962 flow [2023-08-30 02:50:52,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=962, PETRI_PLACES=89, PETRI_TRANSITIONS=89} [2023-08-30 02:50:52,006 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 36 predicate places. [2023-08-30 02:50:52,006 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 89 transitions, 962 flow [2023-08-30 02:50:52,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states 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:50:52,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:52,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:52,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 02:50:52,007 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:52,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:52,007 INFO L85 PathProgramCache]: Analyzing trace with hash -635227410, now seen corresponding path program 2 times [2023-08-30 02:50:52,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:52,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147577066] [2023-08-30 02:50:52,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:52,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:50:52,200 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:50:52,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:50:52,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147577066] [2023-08-30 02:50:52,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147577066] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:50:52,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:50:52,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:50:52,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387037543] [2023-08-30 02:50:52,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:50:52,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:50:52,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:50:52,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:50:52,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:50:52,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 270 [2023-08-30 02:50:52,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 89 transitions, 962 flow. Second operand has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:52,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:50:52,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 270 [2023-08-30 02:50:52,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:50:52,704 INFO L130 PetriNetUnfolder]: 2861/4709 cut-off events. [2023-08-30 02:50:52,704 INFO L131 PetriNetUnfolder]: For 29103/29429 co-relation queries the response was YES. [2023-08-30 02:50:52,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25393 conditions, 4709 events. 2861/4709 cut-off events. For 29103/29429 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 28281 event pairs, 907 based on Foata normal form. 60/4664 useless extension candidates. Maximal degree in co-relation 25366. Up to 2355 conditions per place. [2023-08-30 02:50:52,731 INFO L137 encePairwiseOnDemand]: 266/270 looper letters, 72 selfloop transitions, 13 changer transitions 39/135 dead transitions. [2023-08-30 02:50:52,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 135 transitions, 1631 flow [2023-08-30 02:50:52,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:50:52,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:50:52,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 536 transitions. [2023-08-30 02:50:52,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4962962962962963 [2023-08-30 02:50:52,733 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 536 transitions. [2023-08-30 02:50:52,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 536 transitions. [2023-08-30 02:50:52,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:50:52,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 536 transitions. [2023-08-30 02:50:52,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states 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:50:52,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 270.0) internal successors, (1350), 5 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states 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:50:52,736 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 270.0) internal successors, (1350), 5 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states 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:50:52,736 INFO L175 Difference]: Start difference. First operand has 89 places, 89 transitions, 962 flow. Second operand 4 states and 536 transitions. [2023-08-30 02:50:52,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 135 transitions, 1631 flow [2023-08-30 02:50:52,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 135 transitions, 1571 flow, removed 30 selfloop flow, removed 4 redundant places. [2023-08-30 02:50:52,831 INFO L231 Difference]: Finished difference. Result has 85 places, 75 transitions, 766 flow [2023-08-30 02:50:52,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=766, PETRI_PLACES=85, PETRI_TRANSITIONS=75} [2023-08-30 02:50:52,832 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 32 predicate places. [2023-08-30 02:50:52,832 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 75 transitions, 766 flow [2023-08-30 02:50:52,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:50:52,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:50:52,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:52,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 02:50:52,833 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:50:52,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:50:52,833 INFO L85 PathProgramCache]: Analyzing trace with hash -548356506, now seen corresponding path program 3 times [2023-08-30 02:50:52,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:50:52,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706755226] [2023-08-30 02:50:52,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:50:52,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:50:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:50:52,870 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:50:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:50:52,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:50:52,947 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:50:52,948 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:50:52,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:50:52,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:50:52,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:50:52,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:50:52,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:50:52,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:50:52,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:50:52,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:50:52,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:50:52,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:50:52,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:50:52,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:50:52,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:50:52,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:50:52,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:50:52,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 02:50:52,954 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:50:52,957 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:50:52,957 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:50:53,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:50:53 BasicIcfg [2023-08-30 02:50:53,026 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:50:53,026 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:50:53,027 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:50:53,027 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:50:53,027 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:50:15" (3/4) ... [2023-08-30 02:50:53,029 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:50:53,029 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:50:53,029 INFO L158 Benchmark]: Toolchain (without parser) took 38752.28ms. Allocated memory was 69.2MB in the beginning and 4.1GB in the end (delta: 4.1GB). Free memory was 33.7MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2023-08-30 02:50:53,029 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 69.2MB. Free memory is still 46.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:50:53,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.98ms. Allocated memory was 69.2MB in the beginning and 104.9MB in the end (delta: 35.7MB). Free memory was 33.5MB in the beginning and 80.6MB in the end (delta: -47.1MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2023-08-30 02:50:53,030 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.50ms. Allocated memory is still 104.9MB. Free memory was 80.6MB in the beginning and 78.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:50:53,030 INFO L158 Benchmark]: Boogie Preprocessor took 31.94ms. Allocated memory is still 104.9MB. Free memory was 77.9MB in the beginning and 76.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:50:53,030 INFO L158 Benchmark]: RCFGBuilder took 632.60ms. Allocated memory is still 104.9MB. Free memory was 76.2MB in the beginning and 63.0MB in the end (delta: 13.2MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2023-08-30 02:50:53,030 INFO L158 Benchmark]: TraceAbstraction took 37556.82ms. Allocated memory was 104.9MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 62.1MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-08-30 02:50:53,030 INFO L158 Benchmark]: Witness Printer took 2.25ms. Allocated memory is still 4.1GB. Free memory is still 2.5GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:50:53,031 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.14ms. Allocated memory is still 69.2MB. Free memory is still 46.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 459.98ms. Allocated memory was 69.2MB in the beginning and 104.9MB in the end (delta: 35.7MB). Free memory was 33.5MB in the beginning and 80.6MB in the end (delta: -47.1MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.50ms. Allocated memory is still 104.9MB. Free memory was 80.6MB in the beginning and 78.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.94ms. Allocated memory is still 104.9MB. Free memory was 77.9MB in the beginning and 76.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 632.60ms. Allocated memory is still 104.9MB. Free memory was 76.2MB in the beginning and 63.0MB in the end (delta: 13.2MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * TraceAbstraction took 37556.82ms. Allocated memory was 104.9MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 62.1MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 2.25ms. Allocated memory is still 4.1GB. Free memory is still 2.5GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 149 PlacesBefore, 53 PlacesAfterwards, 138 TransitionsBefore, 41 TransitionsAfterwards, 3524 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 128 TotalNumberOfCompositions, 10664 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4814, independent: 4570, independent conditional: 0, independent unconditional: 4570, dependent: 244, dependent conditional: 0, dependent unconditional: 244, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1826, independent: 1786, independent conditional: 0, independent unconditional: 1786, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4814, independent: 2784, independent conditional: 0, independent unconditional: 2784, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 1826, unknown conditional: 0, unknown unconditional: 1826] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 179, Positive conditional cache size: 0, Positive unconditional cache size: 179, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t713; [L865] FCALL, FORK 0 pthread_create(&t713, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t713, ((void *)0), P0, ((void *)0))=-2, t713={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t714; [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L867] FCALL, FORK 0 pthread_create(&t714, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t714, ((void *)0), P1, ((void *)0))=-1, t713={5:0}, t714={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L868] 0 pthread_t t715; [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L869] FCALL, FORK 0 pthread_create(&t715, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t715, ((void *)0), P2, ((void *)0))=0, t713={5:0}, t714={6:0}, t715={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L870] 0 pthread_t t716; [L871] FCALL, FORK 0 pthread_create(&t716, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t716, ((void *)0), P3, ((void *)0))=1, t713={5:0}, t714={6:0}, t715={7:0}, t716={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t713={5:0}, t714={6:0}, t715={7:0}, t716={3:0}, weak$$choice2=0, x=2, y=1, z=2] [L884] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L886] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 867]: 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: 865]: 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: 869]: 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: 871]: 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 9 procedures, 179 locations, 16 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: 37.4s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 29.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1287 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1127 mSDsluCounter, 703 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 596 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3380 IncrementalHoareTripleChecker+Invalid, 3525 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 107 mSDtfsCounter, 3380 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1420occurred in iteration=12, InterpolantAutomatonStates: 99, 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.6s InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 2264 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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:50:53,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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/mix027_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d8f535cb798ce58a79ec2e9a728d4e5d884025e215c7cfd9880fc53267dd5a20 --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:50:55,117 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:50:55,119 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:50:55,136 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:50:55,137 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:50:55,138 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:50:55,139 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:50:55,140 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:50:55,141 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:50:55,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:50:55,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:50:55,143 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:50:55,143 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:50:55,144 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:50:55,144 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:50:55,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:50:55,146 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:50:55,146 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:50:55,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:50:55,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:50:55,150 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:50:55,151 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:50:55,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:50:55,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:50:55,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:50:55,155 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:50:55,155 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:50:55,156 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:50:55,157 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:50:55,157 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:50:55,157 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:50:55,158 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:50:55,158 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:50:55,159 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:50:55,160 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:50:55,160 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:50:55,160 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:50:55,161 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:50:55,161 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:50:55,161 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:50:55,162 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:50:55,163 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:50:55,182 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:50:55,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:50:55,183 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:50:55,183 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:50:55,188 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:50:55,189 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:50:55,189 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:50:55,189 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:50:55,189 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:50:55,190 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:50:55,190 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:50:55,190 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:50:55,190 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:50:55,190 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:50:55,190 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:50:55,191 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:50:55,191 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:50:55,191 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:50:55,191 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:50:55,191 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:50:55,191 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 02:50:55,191 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 02:50:55,192 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:50:55,192 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:50:55,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:50:55,192 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:50:55,192 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:50:55,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:50:55,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:50:55,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:50:55,193 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 02:50:55,193 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 02:50:55,193 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:50:55,194 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:50:55,194 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:50:55,194 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 02:50:55,194 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:50:55,194 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 -> d8f535cb798ce58a79ec2e9a728d4e5d884025e215c7cfd9880fc53267dd5a20 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:50:55,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:50:55,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:50:55,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:50:55,488 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:50:55,489 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:50:55,490 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 02:50:56,501 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:50:56,761 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:50:56,762 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 02:50:56,771 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da9d92bfc/ccfb67b451ef4b1ca162219e3820c830/FLAG32b76cf04 [2023-08-30 02:50:56,786 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da9d92bfc/ccfb67b451ef4b1ca162219e3820c830 [2023-08-30 02:50:56,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:50:56,789 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:50:56,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:50:56,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:50:56,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:50:56,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:50:56" (1/1) ... [2023-08-30 02:50:56,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a03335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:56, skipping insertion in model container [2023-08-30 02:50:56,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:50:56" (1/1) ... [2023-08-30 02:50:56,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:50:56,838 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:50:57,003 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/mix027_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-30 02:50:57,223 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:50:57,239 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:50:57,252 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/mix027_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-30 02:50:57,314 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:50:57,371 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:50:57,371 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:50:57,376 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:50:57,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:57 WrapperNode [2023-08-30 02:50:57,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:50:57,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:50:57,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:50:57,377 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:50:57,382 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:50:57" (1/1) ... [2023-08-30 02:50:57,408 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:50:57" (1/1) ... [2023-08-30 02:50:57,437 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-30 02:50:57,438 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:50:57,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:50:57,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:50:57,439 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:50:57,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:57" (1/1) ... [2023-08-30 02:50:57,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:57" (1/1) ... [2023-08-30 02:50:57,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:57" (1/1) ... [2023-08-30 02:50:57,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:57" (1/1) ... [2023-08-30 02:50:57,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:57" (1/1) ... [2023-08-30 02:50:57,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:57" (1/1) ... [2023-08-30 02:50:57,483 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:57" (1/1) ... [2023-08-30 02:50:57,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:57" (1/1) ... [2023-08-30 02:50:57,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:50:57,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:50:57,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:50:57,494 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:50:57,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:57" (1/1) ... [2023-08-30 02:50:57,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:50:57,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:50:57,529 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:50:57,552 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:50:57,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:50:57,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:50:57,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:50:57,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:50:57,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 02:50:57,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 02:50:57,572 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:50:57,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:50:57,572 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:50:57,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:50:57,572 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:50:57,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:50:57,573 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:50:57,573 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:50:57,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:50:57,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:50:57,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:50:57,574 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:50:57,790 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:50:57,791 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:50:58,120 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:50:58,203 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:50:58,203 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:50:58,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:50:58 BoogieIcfgContainer [2023-08-30 02:50:58,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:50:58,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:50:58,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:50:58,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:50:58,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:50:56" (1/3) ... [2023-08-30 02:50:58,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a904d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:50:58, skipping insertion in model container [2023-08-30 02:50:58,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:57" (2/3) ... [2023-08-30 02:50:58,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a904d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:50:58, skipping insertion in model container [2023-08-30 02:50:58,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:50:58" (3/3) ... [2023-08-30 02:50:58,211 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 02:50:58,222 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:50:58,222 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:50:58,223 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:50:58,273 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:50:58,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 143 transitions, 306 flow [2023-08-30 02:50:58,326 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-30 02:50:58,326 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:50:58,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-30 02:50:58,331 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 143 transitions, 306 flow [2023-08-30 02:50:58,333 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 139 transitions, 290 flow [2023-08-30 02:50:58,335 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:50:58,341 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-30 02:50:58,343 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-30 02:50:58,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 290 flow [2023-08-30 02:50:58,361 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-30 02:50:58,361 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:50:58,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-30 02:50:58,363 INFO L119 LiptonReduction]: Number of co-enabled transitions 3524 [2023-08-30 02:51:03,496 INFO L134 LiptonReduction]: Checked pairs total: 9358 [2023-08-30 02:51:03,497 INFO L136 LiptonReduction]: Total number of compositions: 133 [2023-08-30 02:51:03,515 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:51:03,535 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;@1e95e6f5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:51:03,536 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:51:03,537 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:51:03,537 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:51:03,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:51:03,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:51:03,538 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:51:03,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:51:03,543 INFO L85 PathProgramCache]: Analyzing trace with hash 606, now seen corresponding path program 1 times [2023-08-30 02:51:03,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:51:03,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885228903] [2023-08-30 02:51:03,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:51:03,564 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:51:03,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:51:03,577 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:51:03,622 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:51:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:51:03,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 02:51:03,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:51:03,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:51:03,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:51:03,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:51:03,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885228903] [2023-08-30 02:51:03,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885228903] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:51:03,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:51:03,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:51:03,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502548107] [2023-08-30 02:51:03,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:51:03,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:51:03,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:51:03,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:51:03,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:51:03,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 276 [2023-08-30 02:51:03,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:51:03,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:51:03,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 276 [2023-08-30 02:51:03,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:51:04,923 INFO L130 PetriNetUnfolder]: 8719/11889 cut-off events. [2023-08-30 02:51:04,923 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-08-30 02:51:04,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23837 conditions, 11889 events. 8719/11889 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 62417 event pairs, 8719 based on Foata normal form. 0/10405 useless extension candidates. Maximal degree in co-relation 23825. Up to 11731 conditions per place. [2023-08-30 02:51:04,988 INFO L137 encePairwiseOnDemand]: 267/276 looper letters, 28 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-08-30 02:51:04,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 132 flow [2023-08-30 02:51:04,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:51:04,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:51:04,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 293 transitions. [2023-08-30 02:51:05,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5307971014492754 [2023-08-30 02:51:05,002 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 293 transitions. [2023-08-30 02:51:05,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 293 transitions. [2023-08-30 02:51:05,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:51:05,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 293 transitions. [2023-08-30 02:51:05,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 146.5) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 0 states 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:51:05,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states 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:51:05,017 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states 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:51:05,018 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 293 transitions. [2023-08-30 02:51:05,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 132 flow [2023-08-30 02:51:05,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:51:05,026 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-08-30 02:51:05,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-30 02:51:05,031 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-30 02:51:05,031 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-08-30 02:51:05,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:51:05,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:51:05,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:51:05,055 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 (2)] Ended with exit code 0 [2023-08-30 02:51:05,257 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:51:05,257 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:51:05,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:51:05,264 INFO L85 PathProgramCache]: Analyzing trace with hash 595464, now seen corresponding path program 1 times [2023-08-30 02:51:05,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:51:05,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826967539] [2023-08-30 02:51:05,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:51:05,267 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:51:05,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:51:05,273 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:51:05,275 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:51:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:51:05,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:51:05,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:51:05,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:51:05,356 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:51:05,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:51:05,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826967539] [2023-08-30 02:51:05,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [826967539] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:51:05,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:51:05,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:51:05,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687199159] [2023-08-30 02:51:05,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:51:05,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:51:05,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:51:05,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:51:05,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:51:05,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 276 [2023-08-30 02:51:05,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states 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:51:05,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:51:05,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 276 [2023-08-30 02:51:05,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:51:06,161 INFO L130 PetriNetUnfolder]: 6855/9434 cut-off events. [2023-08-30 02:51:06,162 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:51:06,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18871 conditions, 9434 events. 6855/9434 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 48821 event pairs, 2695 based on Foata normal form. 0/8778 useless extension candidates. Maximal degree in co-relation 18868. Up to 7399 conditions per place. [2023-08-30 02:51:06,210 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 45 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2023-08-30 02:51:06,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 218 flow [2023-08-30 02:51:06,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:51:06,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:51:06,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-08-30 02:51:06,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5205314009661836 [2023-08-30 02:51:06,213 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-08-30 02:51:06,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-08-30 02:51:06,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:51:06,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-08-30 02:51:06,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states 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:51:06,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states 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:51:06,218 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states 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:51:06,218 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 431 transitions. [2023-08-30 02:51:06,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 218 flow [2023-08-30 02:51:06,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:51:06,219 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-08-30 02:51:06,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-30 02:51:06,220 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-08-30 02:51:06,220 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-08-30 02:51:06,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states 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:51:06,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:51:06,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:51:06,230 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:51:06,428 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:51:06,428 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:51:06,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:51:06,429 INFO L85 PathProgramCache]: Analyzing trace with hash -819052787, now seen corresponding path program 1 times [2023-08-30 02:51:06,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:51:06,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809850952] [2023-08-30 02:51:06,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:51:06,432 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:51:06,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:51:06,433 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:51:06,436 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:51:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:51:06,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:51:06,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:51:06,548 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:51:06,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:51:06,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:51:06,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809850952] [2023-08-30 02:51:06,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809850952] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:51:06,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:51:06,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:51:06,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117091686] [2023-08-30 02:51:06,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:51:06,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:51:06,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:51:06,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:51:06,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:51:06,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 276 [2023-08-30 02:51:06,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states 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:51:06,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:51:06,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 276 [2023-08-30 02:51:06,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:51:07,173 INFO L130 PetriNetUnfolder]: 4483/6404 cut-off events. [2023-08-30 02:51:07,173 INFO L131 PetriNetUnfolder]: For 421/421 co-relation queries the response was YES. [2023-08-30 02:51:07,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13353 conditions, 6404 events. 4483/6404 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 34294 event pairs, 818 based on Foata normal form. 320/6496 useless extension candidates. Maximal degree in co-relation 13349. Up to 4756 conditions per place. [2023-08-30 02:51:07,197 INFO L137 encePairwiseOnDemand]: 269/276 looper letters, 40 selfloop transitions, 5 changer transitions 27/76 dead transitions. [2023-08-30 02:51:07,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 76 transitions, 320 flow [2023-08-30 02:51:07,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:51:07,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:51:07,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 684 transitions. [2023-08-30 02:51:07,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4956521739130435 [2023-08-30 02:51:07,200 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 684 transitions. [2023-08-30 02:51:07,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 684 transitions. [2023-08-30 02:51:07,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:51:07,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 684 transitions. [2023-08-30 02:51:07,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:51:07,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states 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:51:07,204 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states 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:51:07,204 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 5 states and 684 transitions. [2023-08-30 02:51:07,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 76 transitions, 320 flow [2023-08-30 02:51:07,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 76 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:51:07,206 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 113 flow [2023-08-30 02:51:07,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-08-30 02:51:07,206 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2023-08-30 02:51:07,207 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 113 flow [2023-08-30 02:51:07,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states 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:51:07,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:51:07,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:51:07,219 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:51:07,419 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:51:07,419 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:51:07,420 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:51:07,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1027763899, now seen corresponding path program 1 times [2023-08-30 02:51:07,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:51:07,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530818844] [2023-08-30 02:51:07,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:51:07,421 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:51:07,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:51:07,422 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:51:07,459 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:51:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:51:07,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:51:07,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:51:07,564 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:51:07,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:51:07,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:51:07,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530818844] [2023-08-30 02:51:07,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530818844] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:51:07,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:51:07,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:51:07,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961750626] [2023-08-30 02:51:07,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:51:07,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:51:07,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:51:07,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:51:07,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:51:07,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 276 [2023-08-30 02:51:07,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states 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:51:07,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:51:07,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 276 [2023-08-30 02:51:07,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:51:08,057 INFO L130 PetriNetUnfolder]: 2161/3299 cut-off events. [2023-08-30 02:51:08,058 INFO L131 PetriNetUnfolder]: For 1170/1170 co-relation queries the response was YES. [2023-08-30 02:51:08,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8694 conditions, 3299 events. 2161/3299 cut-off events. For 1170/1170 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 17221 event pairs, 403 based on Foata normal form. 212/3418 useless extension candidates. Maximal degree in co-relation 8687. Up to 1426 conditions per place. [2023-08-30 02:51:08,071 INFO L137 encePairwiseOnDemand]: 269/276 looper letters, 53 selfloop transitions, 9 changer transitions 27/93 dead transitions. [2023-08-30 02:51:08,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 93 transitions, 469 flow [2023-08-30 02:51:08,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:51:08,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:51:08,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 823 transitions. [2023-08-30 02:51:08,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4969806763285024 [2023-08-30 02:51:08,074 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 823 transitions. [2023-08-30 02:51:08,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 823 transitions. [2023-08-30 02:51:08,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:51:08,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 823 transitions. [2023-08-30 02:51:08,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.16666666666666) internal successors, (823), 6 states have internal predecessors, (823), 0 states have call successors, (0), 0 states 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:51:08,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states 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:51:08,079 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states 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:51:08,079 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 113 flow. Second operand 6 states and 823 transitions. [2023-08-30 02:51:08,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 93 transitions, 469 flow [2023-08-30 02:51:08,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 93 transitions, 462 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:51:08,092 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 178 flow [2023-08-30 02:51:08,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-08-30 02:51:08,093 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2023-08-30 02:51:08,093 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 178 flow [2023-08-30 02:51:08,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states 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:51:08,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:51:08,094 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:51:08,102 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:51:08,301 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:51:08,302 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:51:08,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:51:08,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1296115085, now seen corresponding path program 1 times [2023-08-30 02:51:08,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:51:08,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403243089] [2023-08-30 02:51:08,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:51:08,303 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:51:08,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:51:08,304 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:51:08,306 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:51:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:51:08,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 02:51:08,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:51:08,446 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:51:08,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:51:08,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:51:08,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403243089] [2023-08-30 02:51:08,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403243089] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:51:08,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:51:08,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:51:08,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41425553] [2023-08-30 02:51:08,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:51:08,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:51:08,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:51:08,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:51:08,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:51:08,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 276 [2023-08-30 02:51:08,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 125.0) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 0 states 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:51:08,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:51:08,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 276 [2023-08-30 02:51:08,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:51:08,920 INFO L130 PetriNetUnfolder]: 1189/1877 cut-off events. [2023-08-30 02:51:08,920 INFO L131 PetriNetUnfolder]: For 1777/1777 co-relation queries the response was YES. [2023-08-30 02:51:08,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5597 conditions, 1877 events. 1189/1877 cut-off events. For 1777/1777 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 9191 event pairs, 331 based on Foata normal form. 77/1924 useless extension candidates. Maximal degree in co-relation 5588. Up to 630 conditions per place. [2023-08-30 02:51:08,931 INFO L137 encePairwiseOnDemand]: 269/276 looper letters, 64 selfloop transitions, 13 changer transitions 27/108 dead transitions. [2023-08-30 02:51:08,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 108 transitions, 638 flow [2023-08-30 02:51:08,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:51:08,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:51:08,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 960 transitions. [2023-08-30 02:51:08,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4968944099378882 [2023-08-30 02:51:08,934 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 960 transitions. [2023-08-30 02:51:08,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 960 transitions. [2023-08-30 02:51:08,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:51:08,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 960 transitions. [2023-08-30 02:51:08,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 137.14285714285714) internal successors, (960), 7 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:51:08,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states 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:51:08,943 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states 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:51:08,943 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 178 flow. Second operand 7 states and 960 transitions. [2023-08-30 02:51:08,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 108 transitions, 638 flow [2023-08-30 02:51:08,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 108 transitions, 576 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-30 02:51:08,955 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 228 flow [2023-08-30 02:51:08,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=228, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2023-08-30 02:51:08,956 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2023-08-30 02:51:08,956 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 228 flow [2023-08-30 02:51:08,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.0) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 0 states 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:51:08,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:51:08,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:51:08,979 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:51:09,164 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:51:09,165 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:51:09,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:51:09,165 INFO L85 PathProgramCache]: Analyzing trace with hash 520062741, now seen corresponding path program 1 times [2023-08-30 02:51:09,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:51:09,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647546318] [2023-08-30 02:51:09,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:51:09,166 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:51:09,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:51:09,167 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:51:09,169 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:51:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:51:09,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 02:51:09,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:51:09,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:51:09,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:51:09,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:51:09,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647546318] [2023-08-30 02:51:09,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647546318] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:51:09,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:51:09,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:51:09,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200007874] [2023-08-30 02:51:09,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:51:09,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:51:09,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:51:09,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:51:09,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:51:09,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 276 [2023-08-30 02:51:09,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 228 flow. Second operand has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states 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:51:09,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:51:09,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 276 [2023-08-30 02:51:09,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:51:09,712 INFO L130 PetriNetUnfolder]: 1011/1571 cut-off events. [2023-08-30 02:51:09,712 INFO L131 PetriNetUnfolder]: For 1422/1422 co-relation queries the response was YES. [2023-08-30 02:51:09,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4523 conditions, 1571 events. 1011/1571 cut-off events. For 1422/1422 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7528 event pairs, 326 based on Foata normal form. 14/1568 useless extension candidates. Maximal degree in co-relation 4513. Up to 630 conditions per place. [2023-08-30 02:51:09,717 INFO L137 encePairwiseOnDemand]: 269/276 looper letters, 60 selfloop transitions, 17 changer transitions 14/95 dead transitions. [2023-08-30 02:51:09,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 95 transitions, 574 flow [2023-08-30 02:51:09,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:51:09,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:51:09,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1069 transitions. [2023-08-30 02:51:09,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4841485507246377 [2023-08-30 02:51:09,720 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1069 transitions. [2023-08-30 02:51:09,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1069 transitions. [2023-08-30 02:51:09,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:51:09,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1069 transitions. [2023-08-30 02:51:09,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 133.625) internal successors, (1069), 8 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states 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:51:09,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 276.0) internal successors, (2484), 9 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states 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:51:09,725 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 276.0) internal successors, (2484), 9 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states 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:51:09,725 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 228 flow. Second operand 8 states and 1069 transitions. [2023-08-30 02:51:09,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 95 transitions, 574 flow [2023-08-30 02:51:09,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 95 transitions, 512 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-30 02:51:09,735 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 222 flow [2023-08-30 02:51:09,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=222, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2023-08-30 02:51:09,736 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2023-08-30 02:51:09,736 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 222 flow [2023-08-30 02:51:09,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states 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:51:09,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:51:09,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:51:09,757 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:51:09,944 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:51:09,944 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:51:09,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:51:09,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1003412095, now seen corresponding path program 1 times [2023-08-30 02:51:09,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:51:09,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [620855336] [2023-08-30 02:51:09,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:51:09,945 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:51:09,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:51:09,949 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:51:09,950 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:51:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:51:10,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-30 02:51:10,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:51:10,558 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:51:10,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:51:10,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:51:10,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [620855336] [2023-08-30 02:51:10,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [620855336] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:51:10,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:51:10,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:51:10,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863394376] [2023-08-30 02:51:10,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:51:10,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:51:10,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:51:10,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:51:10,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:51:11,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 276 [2023-08-30 02:51:11,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states 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:51:11,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:51:11,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 276 [2023-08-30 02:51:11,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:51:11,590 INFO L130 PetriNetUnfolder]: 999/1569 cut-off events. [2023-08-30 02:51:11,590 INFO L131 PetriNetUnfolder]: For 1929/1929 co-relation queries the response was YES. [2023-08-30 02:51:11,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4472 conditions, 1569 events. 999/1569 cut-off events. For 1929/1929 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7665 event pairs, 28 based on Foata normal form. 0/1569 useless extension candidates. Maximal degree in co-relation 4461. Up to 1252 conditions per place. [2023-08-30 02:51:11,598 INFO L137 encePairwiseOnDemand]: 271/276 looper letters, 59 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2023-08-30 02:51:11,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 67 transitions, 479 flow [2023-08-30 02:51:11,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:51:11,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:51:11,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 692 transitions. [2023-08-30 02:51:11,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4178743961352657 [2023-08-30 02:51:11,601 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 692 transitions. [2023-08-30 02:51:11,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 692 transitions. [2023-08-30 02:51:11,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:51:11,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 692 transitions. [2023-08-30 02:51:11,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states 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:51:11,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states 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:51:11,604 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states 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:51:11,605 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 222 flow. Second operand 6 states and 692 transitions. [2023-08-30 02:51:11,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 67 transitions, 479 flow [2023-08-30 02:51:11,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 390 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-08-30 02:51:11,610 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 164 flow [2023-08-30 02:51:11,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-08-30 02:51:11,610 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2023-08-30 02:51:11,610 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 164 flow [2023-08-30 02:51:11,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states 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:51:11,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:51:11,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:51:11,621 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:51:11,819 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:51:11,820 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:51:11,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:51:11,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1712304673, now seen corresponding path program 1 times [2023-08-30 02:51:11,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:51:11,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69469067] [2023-08-30 02:51:11,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:51:11,821 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:51:11,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:51:11,822 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:51:11,824 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:51:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:51:11,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:51:11,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:51:11,966 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:51:11,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:51:11,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:51:11,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [69469067] [2023-08-30 02:51:11,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [69469067] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:51:11,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:51:11,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:51:11,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141483422] [2023-08-30 02:51:11,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:51:11,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:51:11,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:51:11,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:51:11,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:51:11,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 276 [2023-08-30 02:51:11,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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:51:11,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:51:11,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 276 [2023-08-30 02:51:11,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:51:12,301 INFO L130 PetriNetUnfolder]: 1766/2794 cut-off events. [2023-08-30 02:51:12,301 INFO L131 PetriNetUnfolder]: For 1571/1571 co-relation queries the response was YES. [2023-08-30 02:51:12,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7378 conditions, 2794 events. 1766/2794 cut-off events. For 1571/1571 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 15244 event pairs, 249 based on Foata normal form. 1/2794 useless extension candidates. Maximal degree in co-relation 7370. Up to 1351 conditions per place. [2023-08-30 02:51:12,311 INFO L137 encePairwiseOnDemand]: 272/276 looper letters, 54 selfloop transitions, 1 changer transitions 30/88 dead transitions. [2023-08-30 02:51:12,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 88 transitions, 536 flow [2023-08-30 02:51:12,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:51:12,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:51:12,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 671 transitions. [2023-08-30 02:51:12,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.486231884057971 [2023-08-30 02:51:12,313 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 671 transitions. [2023-08-30 02:51:12,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 671 transitions. [2023-08-30 02:51:12,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:51:12,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 671 transitions. [2023-08-30 02:51:12,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.2) internal successors, (671), 5 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:51:12,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states 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:51:12,317 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states 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:51:12,317 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 164 flow. Second operand 5 states and 671 transitions. [2023-08-30 02:51:12,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 88 transitions, 536 flow [2023-08-30 02:51:12,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 88 transitions, 527 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:51:12,330 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 166 flow [2023-08-30 02:51:12,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2023-08-30 02:51:12,331 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2023-08-30 02:51:12,331 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 166 flow [2023-08-30 02:51:12,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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:51:12,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:51:12,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:51:12,347 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:51:12,539 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:51:12,540 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:51:12,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:51:12,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1823722365, now seen corresponding path program 2 times [2023-08-30 02:51:12,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:51:12,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943292959] [2023-08-30 02:51:12,541 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:51:12,541 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:51:12,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:51:12,542 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:51:12,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-30 02:51:12,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:51:12,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:51:12,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-30 02:51:12,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:51:12,892 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:51:12,892 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:51:12,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:51:12,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943292959] [2023-08-30 02:51:12,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [943292959] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:51:12,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:51:12,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:51:12,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884423976] [2023-08-30 02:51:12,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:51:12,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:51:12,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:51:12,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:51:12,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:51:12,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 276 [2023-08-30 02:51:12,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 166 flow. Second operand has 8 states, 8 states have (on average 124.125) internal successors, (993), 8 states have internal predecessors, (993), 0 states have call successors, (0), 0 states 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:51:12,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:51:12,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 276 [2023-08-30 02:51:12,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:51:13,376 INFO L130 PetriNetUnfolder]: 1734/2882 cut-off events. [2023-08-30 02:51:13,376 INFO L131 PetriNetUnfolder]: For 2284/2286 co-relation queries the response was YES. [2023-08-30 02:51:13,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8063 conditions, 2882 events. 1734/2882 cut-off events. For 2284/2286 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 16846 event pairs, 417 based on Foata normal form. 2/2846 useless extension candidates. Maximal degree in co-relation 8052. Up to 982 conditions per place. [2023-08-30 02:51:13,387 INFO L137 encePairwiseOnDemand]: 268/276 looper letters, 84 selfloop transitions, 6 changer transitions 46/140 dead transitions. [2023-08-30 02:51:13,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 140 transitions, 889 flow [2023-08-30 02:51:13,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:51:13,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:51:13,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1051 transitions. [2023-08-30 02:51:13,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4759963768115942 [2023-08-30 02:51:13,390 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1051 transitions. [2023-08-30 02:51:13,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1051 transitions. [2023-08-30 02:51:13,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:51:13,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1051 transitions. [2023-08-30 02:51:13,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.375) internal successors, (1051), 8 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states 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:51:13,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 276.0) internal successors, (2484), 9 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states 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:51:13,395 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 276.0) internal successors, (2484), 9 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states 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:51:13,395 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 166 flow. Second operand 8 states and 1051 transitions. [2023-08-30 02:51:13,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 140 transitions, 889 flow [2023-08-30 02:51:13,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 140 transitions, 879 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 02:51:13,417 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 201 flow [2023-08-30 02:51:13,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=201, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2023-08-30 02:51:13,418 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2023-08-30 02:51:13,418 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 201 flow [2023-08-30 02:51:13,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 124.125) internal successors, (993), 8 states have internal predecessors, (993), 0 states have call successors, (0), 0 states 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:51:13,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:51:13,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:51:13,427 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 (10)] Ended with exit code 0 [2023-08-30 02:51:13,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:51:13,627 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:51:13,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:51:13,627 INFO L85 PathProgramCache]: Analyzing trace with hash 2074547687, now seen corresponding path program 3 times [2023-08-30 02:51:13,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:51:13,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794027131] [2023-08-30 02:51:13,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:51:13,628 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:51:13,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:51:13,645 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:51:13,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-30 02:51:13,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 02:51:13,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:51:13,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:51:13,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:51:13,772 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:51:13,773 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:51:13,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:51:13,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794027131] [2023-08-30 02:51:13,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794027131] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:51:13,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:51:13,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:51:13,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49405653] [2023-08-30 02:51:13,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:51:13,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:51:13,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:51:13,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:51:13,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:51:13,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 276 [2023-08-30 02:51:13,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 201 flow. Second operand has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states 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:51:13,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:51:13,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 276 [2023-08-30 02:51:13,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:51:14,140 INFO L130 PetriNetUnfolder]: 2528/4022 cut-off events. [2023-08-30 02:51:14,140 INFO L131 PetriNetUnfolder]: For 3769/3772 co-relation queries the response was YES. [2023-08-30 02:51:14,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12637 conditions, 4022 events. 2528/4022 cut-off events. For 3769/3772 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 23490 event pairs, 982 based on Foata normal form. 2/3948 useless extension candidates. Maximal degree in co-relation 12623. Up to 2066 conditions per place. [2023-08-30 02:51:14,154 INFO L137 encePairwiseOnDemand]: 272/276 looper letters, 52 selfloop transitions, 2 changer transitions 23/80 dead transitions. [2023-08-30 02:51:14,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 80 transitions, 518 flow [2023-08-30 02:51:14,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:51:14,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:51:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 544 transitions. [2023-08-30 02:51:14,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4927536231884058 [2023-08-30 02:51:14,156 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 544 transitions. [2023-08-30 02:51:14,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 544 transitions. [2023-08-30 02:51:14,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:51:14,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 544 transitions. [2023-08-30 02:51:14,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states 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:51:14,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 276.0) internal successors, (1380), 5 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states 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:51:14,159 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 276.0) internal successors, (1380), 5 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states 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:51:14,159 INFO L175 Difference]: Start difference. First operand has 62 places, 45 transitions, 201 flow. Second operand 4 states and 544 transitions. [2023-08-30 02:51:14,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 80 transitions, 518 flow [2023-08-30 02:51:14,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 80 transitions, 507 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-30 02:51:14,195 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 195 flow [2023-08-30 02:51:14,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2023-08-30 02:51:14,196 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2023-08-30 02:51:14,196 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 195 flow [2023-08-30 02:51:14,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states 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:51:14,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:51:14,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:51:14,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-30 02:51:14,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:51:14,405 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:51:14,405 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:51:14,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1822405465, now seen corresponding path program 4 times [2023-08-30 02:51:14,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:51:14,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360262941] [2023-08-30 02:51:14,406 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 02:51:14,406 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:51:14,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:51:14,421 INFO L229 MonitoredProcess]: Starting monitored process 12 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:51:14,465 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 (12)] Waiting until timeout for monitored process [2023-08-30 02:51:14,546 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 02:51:14,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:51:14,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-30 02:51:14,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:51:14,872 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:51:14,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:51:14,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:51:14,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360262941] [2023-08-30 02:51:14,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360262941] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:51:14,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:51:14,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 02:51:14,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756691346] [2023-08-30 02:51:14,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:51:14,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 02:51:14,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:51:14,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 02:51:14,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-30 02:51:14,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 276 [2023-08-30 02:51:14,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 43 transitions, 195 flow. Second operand has 9 states, 9 states have (on average 123.77777777777777) internal successors, (1114), 9 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states 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:51:14,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:51:14,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 276 [2023-08-30 02:51:14,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:51:15,232 INFO L130 PetriNetUnfolder]: 896/1449 cut-off events. [2023-08-30 02:51:15,232 INFO L131 PetriNetUnfolder]: For 1443/1460 co-relation queries the response was YES. [2023-08-30 02:51:15,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4899 conditions, 1449 events. 896/1449 cut-off events. For 1443/1460 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6742 event pairs, 141 based on Foata normal form. 17/1459 useless extension candidates. Maximal degree in co-relation 4886. Up to 887 conditions per place. [2023-08-30 02:51:15,237 INFO L137 encePairwiseOnDemand]: 269/276 looper letters, 57 selfloop transitions, 5 changer transitions 31/97 dead transitions. [2023-08-30 02:51:15,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 97 transitions, 625 flow [2023-08-30 02:51:15,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:51:15,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:51:15,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1031 transitions. [2023-08-30 02:51:15,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46693840579710144 [2023-08-30 02:51:15,250 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1031 transitions. [2023-08-30 02:51:15,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1031 transitions. [2023-08-30 02:51:15,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:51:15,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1031 transitions. [2023-08-30 02:51:15,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 128.875) internal successors, (1031), 8 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states 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:51:15,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 276.0) internal successors, (2484), 9 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states 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:51:15,266 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 276.0) internal successors, (2484), 9 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states 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:51:15,266 INFO L175 Difference]: Start difference. First operand has 60 places, 43 transitions, 195 flow. Second operand 8 states and 1031 transitions. [2023-08-30 02:51:15,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 97 transitions, 625 flow [2023-08-30 02:51:15,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 97 transitions, 603 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-30 02:51:15,290 INFO L231 Difference]: Finished difference. Result has 65 places, 43 transitions, 200 flow [2023-08-30 02:51:15,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=200, PETRI_PLACES=65, PETRI_TRANSITIONS=43} [2023-08-30 02:51:15,291 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2023-08-30 02:51:15,291 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 43 transitions, 200 flow [2023-08-30 02:51:15,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 123.77777777777777) internal successors, (1114), 9 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states 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:51:15,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:51:15,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:51:15,301 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 (12)] Forceful destruction successful, exit code 0 [2023-08-30 02:51:15,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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:51:15,499 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:51:15,499 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:51:15,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1488280297, now seen corresponding path program 5 times [2023-08-30 02:51:15,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:51:15,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [377016877] [2023-08-30 02:51:15,500 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 02:51:15,500 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:51:15,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:51:15,501 INFO L229 MonitoredProcess]: Starting monitored process 13 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:51:15,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 (13)] Waiting until timeout for monitored process [2023-08-30 02:51:15,632 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:51:15,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:51:15,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:51:15,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:51:15,685 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:51:15,685 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:51:15,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:51:15,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [377016877] [2023-08-30 02:51:15,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [377016877] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:51:15,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:51:15,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:51:15,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29439095] [2023-08-30 02:51:15,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:51:15,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:51:15,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:51:15,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:51:15,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:51:15,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 276 [2023-08-30 02:51:15,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 43 transitions, 200 flow. Second operand has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states 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:51:15,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:51:15,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 276 [2023-08-30 02:51:15,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:51:15,951 INFO L130 PetriNetUnfolder]: 1302/2121 cut-off events. [2023-08-30 02:51:15,951 INFO L131 PetriNetUnfolder]: For 3536/3539 co-relation queries the response was YES. [2023-08-30 02:51:15,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6830 conditions, 2121 events. 1302/2121 cut-off events. For 3536/3539 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10869 event pairs, 503 based on Foata normal form. 1/2094 useless extension candidates. Maximal degree in co-relation 6816. Up to 1123 conditions per place. [2023-08-30 02:51:15,960 INFO L137 encePairwiseOnDemand]: 272/276 looper letters, 46 selfloop transitions, 2 changer transitions 23/74 dead transitions. [2023-08-30 02:51:15,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 74 transitions, 501 flow [2023-08-30 02:51:15,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:51:15,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:51:15,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 540 transitions. [2023-08-30 02:51:15,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4891304347826087 [2023-08-30 02:51:15,962 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 540 transitions. [2023-08-30 02:51:15,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 540 transitions. [2023-08-30 02:51:15,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:51:15,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 540 transitions. [2023-08-30 02:51:15,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states 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:51:15,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 276.0) internal successors, (1380), 5 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states 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:51:15,965 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 276.0) internal successors, (1380), 5 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states 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:51:15,965 INFO L175 Difference]: Start difference. First operand has 65 places, 43 transitions, 200 flow. Second operand 4 states and 540 transitions. [2023-08-30 02:51:15,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 74 transitions, 501 flow [2023-08-30 02:51:15,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 469 flow, removed 5 selfloop flow, removed 7 redundant places. [2023-08-30 02:51:15,975 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 192 flow [2023-08-30 02:51:15,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2023-08-30 02:51:15,975 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2023-08-30 02:51:15,975 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 192 flow [2023-08-30 02:51:15,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states 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:51:15,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:51:15,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:51:15,983 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 (13)] Forceful destruction successful, exit code 0 [2023-08-30 02:51:16,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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:51:16,183 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:51:16,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:51:16,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2051396215, now seen corresponding path program 6 times [2023-08-30 02:51:16,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:51:16,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [866205543] [2023-08-30 02:51:16,184 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 02:51:16,184 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:51:16,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:51:16,186 INFO L229 MonitoredProcess]: Starting monitored process 14 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:51:16,188 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 (14)] Waiting until timeout for monitored process [2023-08-30 02:51:16,325 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-08-30 02:51:16,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 02:51:16,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:51:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:51:16,487 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 02:51:16,505 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:51:16,506 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:51:16,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:51:16,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:51:16,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:51:16,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:51:16,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:51:16,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:51:16,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:51:16,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:51:16,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:51:16,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:51:16,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:51:16,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:51:16,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:51:16,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:51:16,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:51:16,533 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 (14)] Ended with exit code 0 [2023-08-30 02:51:16,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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:51:16,709 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:51:16,714 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:51:16,714 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:51:16,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:51:16 BasicIcfg [2023-08-30 02:51:16,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:51:16,796 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:51:16,796 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:51:16,796 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:51:16,796 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:50:58" (3/4) ... [2023-08-30 02:51:16,810 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:51:16,811 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:51:16,811 INFO L158 Benchmark]: Toolchain (without parser) took 20022.09ms. Allocated memory was 90.2MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 66.4MB in the beginning and 566.6MB in the end (delta: -500.3MB). Peak memory consumption was 522.4MB. Max. memory is 16.1GB. [2023-08-30 02:51:16,811 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 62.9MB. Free memory was 41.4MB in the beginning and 41.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:51:16,811 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.59ms. Allocated memory is still 90.2MB. Free memory was 66.1MB in the beginning and 63.1MB in the end (delta: 3.0MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2023-08-30 02:51:16,812 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.51ms. Allocated memory is still 90.2MB. Free memory was 63.1MB in the beginning and 60.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:51:16,812 INFO L158 Benchmark]: Boogie Preprocessor took 50.45ms. Allocated memory is still 90.2MB. Free memory was 60.6MB in the beginning and 58.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:51:16,812 INFO L158 Benchmark]: RCFGBuilder took 712.11ms. Allocated memory is still 90.2MB. Free memory was 58.0MB in the beginning and 43.7MB in the end (delta: 14.3MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. [2023-08-30 02:51:16,812 INFO L158 Benchmark]: TraceAbstraction took 18588.71ms. Allocated memory was 90.2MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 42.6MB in the beginning and 566.6MB in the end (delta: -524.0MB). Peak memory consumption was 494.7MB. Max. memory is 16.1GB. [2023-08-30 02:51:16,812 INFO L158 Benchmark]: Witness Printer took 14.88ms. Allocated memory is still 1.1GB. Free memory is still 566.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:51:16,813 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 62.9MB. Free memory was 41.4MB in the beginning and 41.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 586.59ms. Allocated memory is still 90.2MB. Free memory was 66.1MB in the beginning and 63.1MB in the end (delta: 3.0MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.51ms. Allocated memory is still 90.2MB. Free memory was 63.1MB in the beginning and 60.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.45ms. Allocated memory is still 90.2MB. Free memory was 60.6MB in the beginning and 58.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 712.11ms. Allocated memory is still 90.2MB. Free memory was 58.0MB in the beginning and 43.7MB in the end (delta: 14.3MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. * TraceAbstraction took 18588.71ms. Allocated memory was 90.2MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 42.6MB in the beginning and 566.6MB in the end (delta: -524.0MB). Peak memory consumption was 494.7MB. Max. memory is 16.1GB. * Witness Printer took 14.88ms. Allocated memory is still 1.1GB. Free memory is still 566.6MB. 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.2s, 150 PlacesBefore, 53 PlacesAfterwards, 139 TransitionsBefore, 41 TransitionsAfterwards, 3524 CoEnabledTransitionPairs, 6 FixpointIterations, 52 TrivialSequentialCompositions, 73 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 133 TotalNumberOfCompositions, 9358 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4430, independent: 4225, independent conditional: 0, independent unconditional: 4225, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1830, independent: 1797, independent conditional: 0, independent unconditional: 1797, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4430, independent: 2428, independent conditional: 0, independent unconditional: 2428, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 1830, unknown conditional: 0, unknown unconditional: 1830] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 191, Positive conditional cache size: 0, Positive unconditional cache size: 191, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t713; [L865] FCALL, FORK 0 pthread_create(&t713, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t713, ((void *)0), P0, ((void *)0))=-1, t713={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t714; [L867] FCALL, FORK 0 pthread_create(&t714, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t714, ((void *)0), P1, ((void *)0))=0, t713={3:0}, t714={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t715; [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L869] FCALL, FORK 0 pthread_create(&t715, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t715, ((void *)0), P2, ((void *)0))=1, t713={3:0}, t714={7:0}, t715={11:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L870] 0 pthread_t t716; [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L871] FCALL, FORK 0 pthread_create(&t716, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t716, ((void *)0), P3, ((void *)0))=2, t713={3:0}, t714={7:0}, t715={11:0}, t716={15:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t713={3:0}, t714={7:0}, t715={11:0}, t716={15:0}, weak$$choice2=0, x=2, y=1, z=2] [L884] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L886] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 867]: 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: 865]: 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: 871]: 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: 869]: 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 9 procedures, 180 locations, 16 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: 18.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 767 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 604 mSDsluCounter, 470 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 389 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2803 IncrementalHoareTripleChecker+Invalid, 2897 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 81 mSDtfsCounter, 2803 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 253 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=5, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 279 NumberOfCodeBlocks, 279 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 238 ConstructedInterpolants, 16 QuantifiedInterpolants, 2259 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1916 ConjunctsInSsa, 97 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:51:16,837 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