./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_9.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 35987657 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 ../sv-benchmarks/c/locks/test_locks_9.c -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 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:56:57,793 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:56:57,797 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:56:57,840 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:56:57,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:56:57,842 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:56:57,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:56:57,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:56:57,858 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:56:57,863 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:56:57,864 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:56:57,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:56:57,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:56:57,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:56:57,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:56:57,876 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:56:57,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:56:57,879 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:56:57,880 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:56:57,885 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:56:57,887 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:56:57,888 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:56:57,890 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:56:57,891 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:56:57,892 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:56:57,899 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:56:57,899 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:56:57,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:56:57,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:56:57,901 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:56:57,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:56:57,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:56:57,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:56:57,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:56:57,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:56:57,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:56:57,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:56:57,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:56:57,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:56:57,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:56:57,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:56:57,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:56:57,917 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-21 17:56:57,954 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:56:57,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:56:57,955 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:56:57,955 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:56:57,956 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:56:57,956 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:56:57,957 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:56:57,957 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:56:57,957 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:56:57,958 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:56:57,958 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:56:57,958 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:56:57,959 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:56:57,959 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:56:57,959 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:56:57,959 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:56:57,960 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:56:57,960 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:56:57,960 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:56:57,960 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:56:57,960 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:56:57,961 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:56:57,961 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:56:57,961 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:56:57,961 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:56:57,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:56:57,962 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:56:57,962 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:56:57,962 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 17:56:57,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 17:56:57,963 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 [2022-07-21 17:56:58,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:56:58,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:56:58,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:56:58,301 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:56:58,302 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:56:58,303 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_9.c [2022-07-21 17:56:58,361 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c88bd91f/d384fefa8bb741ac90194e81139c27a9/FLAG977895eaa [2022-07-21 17:56:58,806 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:56:58,807 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c [2022-07-21 17:56:58,815 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c88bd91f/d384fefa8bb741ac90194e81139c27a9/FLAG977895eaa [2022-07-21 17:56:59,191 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c88bd91f/d384fefa8bb741ac90194e81139c27a9 [2022-07-21 17:56:59,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:56:59,195 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:56:59,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:56:59,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:56:59,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:56:59,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:56:59" (1/1) ... [2022-07-21 17:56:59,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@387542cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:59, skipping insertion in model container [2022-07-21 17:56:59,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:56:59" (1/1) ... [2022-07-21 17:56:59,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:56:59,230 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:56:59,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c[3555,3568] [2022-07-21 17:56:59,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:56:59,377 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 17:56:59,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c[3555,3568] [2022-07-21 17:56:59,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:56:59,461 INFO L208 MainTranslator]: Completed translation [2022-07-21 17:56:59,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:59 WrapperNode [2022-07-21 17:56:59,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:56:59,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 17:56:59,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 17:56:59,465 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 17:56:59,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:59" (1/1) ... [2022-07-21 17:56:59,476 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:59" (1/1) ... [2022-07-21 17:56:59,492 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 127 [2022-07-21 17:56:59,493 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 17:56:59,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 17:56:59,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 17:56:59,494 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 17:56:59,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:59" (1/1) ... [2022-07-21 17:56:59,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:59" (1/1) ... [2022-07-21 17:56:59,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:59" (1/1) ... [2022-07-21 17:56:59,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:59" (1/1) ... [2022-07-21 17:56:59,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:59" (1/1) ... [2022-07-21 17:56:59,527 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:59" (1/1) ... [2022-07-21 17:56:59,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:59" (1/1) ... [2022-07-21 17:56:59,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 17:56:59,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 17:56:59,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 17:56:59,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 17:56:59,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:59" (1/1) ... [2022-07-21 17:56:59,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:56:59,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:56:59,572 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) [2022-07-21 17:56:59,598 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 [2022-07-21 17:56:59,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 17:56:59,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 17:56:59,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 17:56:59,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 17:56:59,688 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 17:56:59,689 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 17:56:59,947 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 17:56:59,953 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 17:56:59,953 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 17:56:59,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:56:59 BoogieIcfgContainer [2022-07-21 17:56:59,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 17:56:59,957 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 17:56:59,957 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 17:56:59,960 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 17:56:59,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:56:59" (1/3) ... [2022-07-21 17:56:59,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f31245f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:56:59, skipping insertion in model container [2022-07-21 17:56:59,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:56:59" (2/3) ... [2022-07-21 17:56:59,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f31245f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:56:59, skipping insertion in model container [2022-07-21 17:56:59,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:56:59" (3/3) ... [2022-07-21 17:56:59,962 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2022-07-21 17:56:59,993 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 17:56:59,994 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-21 17:57:00,056 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 17:57:00,066 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=FINITE_AUTOMATA, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6077d4a1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@48cfb9c4 [2022-07-21 17:57:00,066 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-21 17:57:00,076 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 37 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:00,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-21 17:57:00,085 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:00,086 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-21 17:57:00,087 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:00,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:00,096 INFO L85 PathProgramCache]: Analyzing trace with hash 28702923, now seen corresponding path program 1 times [2022-07-21 17:57:00,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:00,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033592292] [2022-07-21 17:57:00,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:00,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:00,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:00,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:00,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033592292] [2022-07-21 17:57:00,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033592292] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:00,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:00,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:57:00,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952590874] [2022-07-21 17:57:00,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:00,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 17:57:00,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:00,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 17:57:00,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 17:57:00,287 INFO L87 Difference]: Start difference. First operand has 38 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 37 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:00,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:00,304 INFO L93 Difference]: Finished difference Result 38 states and 64 transitions. [2022-07-21 17:57:00,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 17:57:00,306 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-21 17:57:00,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:00,313 INFO L225 Difference]: With dead ends: 38 [2022-07-21 17:57:00,314 INFO L226 Difference]: Without dead ends: 36 [2022-07-21 17:57:00,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 17:57:00,321 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:00,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:00,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-21 17:57:00,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-21 17:57:00,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 35 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 62 transitions. [2022-07-21 17:57:00,374 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 62 transitions. Word has length 5 [2022-07-21 17:57:00,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:00,375 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 62 transitions. [2022-07-21 17:57:00,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:00,376 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 62 transitions. [2022-07-21 17:57:00,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 17:57:00,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:00,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 17:57:00,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 17:57:00,377 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:00,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:00,378 INFO L85 PathProgramCache]: Analyzing trace with hash 889697419, now seen corresponding path program 1 times [2022-07-21 17:57:00,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:00,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499638635] [2022-07-21 17:57:00,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:00,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:00,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:00,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499638635] [2022-07-21 17:57:00,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499638635] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:00,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:00,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:57:00,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786319068] [2022-07-21 17:57:00,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:00,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:57:00,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:00,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:57:00,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:00,454 INFO L87 Difference]: Start difference. First operand 36 states and 62 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:00,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:00,469 INFO L93 Difference]: Finished difference Result 35 states and 61 transitions. [2022-07-21 17:57:00,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:57:00,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-21 17:57:00,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:00,471 INFO L225 Difference]: With dead ends: 35 [2022-07-21 17:57:00,471 INFO L226 Difference]: Without dead ends: 33 [2022-07-21 17:57:00,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:00,473 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:00,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 61 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:00,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-21 17:57:00,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-21 17:57:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:00,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 59 transitions. [2022-07-21 17:57:00,479 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 59 transitions. Word has length 6 [2022-07-21 17:57:00,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:00,479 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 59 transitions. [2022-07-21 17:57:00,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:00,479 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 59 transitions. [2022-07-21 17:57:00,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 17:57:00,480 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:00,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:57:00,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 17:57:00,481 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:00,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:00,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1657621241, now seen corresponding path program 1 times [2022-07-21 17:57:00,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:00,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194441703] [2022-07-21 17:57:00,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:00,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:00,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:00,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:00,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194441703] [2022-07-21 17:57:00,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194441703] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:00,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:00,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:57:00,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622794042] [2022-07-21 17:57:00,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:00,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:57:00,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:00,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:57:00,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:00,554 INFO L87 Difference]: Start difference. First operand 33 states and 59 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:00,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:00,572 INFO L93 Difference]: Finished difference Result 63 states and 113 transitions. [2022-07-21 17:57:00,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:57:00,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-21 17:57:00,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:00,574 INFO L225 Difference]: With dead ends: 63 [2022-07-21 17:57:00,575 INFO L226 Difference]: Without dead ends: 63 [2022-07-21 17:57:00,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:00,576 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 43 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:00,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 115 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:00,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-21 17:57:00,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 43. [2022-07-21 17:57:00,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:00,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 78 transitions. [2022-07-21 17:57:00,584 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 78 transitions. Word has length 16 [2022-07-21 17:57:00,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:00,585 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 78 transitions. [2022-07-21 17:57:00,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:00,585 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 78 transitions. [2022-07-21 17:57:00,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 17:57:00,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:00,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:57:00,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 17:57:00,586 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:00,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:00,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1399455803, now seen corresponding path program 1 times [2022-07-21 17:57:00,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:00,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055995759] [2022-07-21 17:57:00,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:00,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:00,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:00,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:00,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055995759] [2022-07-21 17:57:00,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055995759] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:00,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:00,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:57:00,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501507872] [2022-07-21 17:57:00,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:00,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:57:00,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:00,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:57:00,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:00,625 INFO L87 Difference]: Start difference. First operand 43 states and 78 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:00,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:00,641 INFO L93 Difference]: Finished difference Result 63 states and 111 transitions. [2022-07-21 17:57:00,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:57:00,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-21 17:57:00,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:00,643 INFO L225 Difference]: With dead ends: 63 [2022-07-21 17:57:00,643 INFO L226 Difference]: Without dead ends: 63 [2022-07-21 17:57:00,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:00,644 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 43 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:00,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 129 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:00,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-21 17:57:00,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2022-07-21 17:57:00,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 60 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:00,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 110 transitions. [2022-07-21 17:57:00,651 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 110 transitions. Word has length 16 [2022-07-21 17:57:00,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:00,652 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 110 transitions. [2022-07-21 17:57:00,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:00,652 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 110 transitions. [2022-07-21 17:57:00,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 17:57:00,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:00,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:57:00,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 17:57:00,653 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:00,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:00,654 INFO L85 PathProgramCache]: Analyzing trace with hash 153562753, now seen corresponding path program 1 times [2022-07-21 17:57:00,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:00,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479710852] [2022-07-21 17:57:00,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:00,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:00,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:00,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:00,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479710852] [2022-07-21 17:57:00,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479710852] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:00,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:00,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:57:00,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103499459] [2022-07-21 17:57:00,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:00,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:57:00,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:00,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:57:00,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:00,718 INFO L87 Difference]: Start difference. First operand 61 states and 110 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:00,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:00,741 INFO L93 Difference]: Finished difference Result 66 states and 113 transitions. [2022-07-21 17:57:00,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:57:00,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-21 17:57:00,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:00,743 INFO L225 Difference]: With dead ends: 66 [2022-07-21 17:57:00,743 INFO L226 Difference]: Without dead ends: 66 [2022-07-21 17:57:00,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:00,745 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 45 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:00,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 144 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:00,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-21 17:57:00,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-07-21 17:57:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 63 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 112 transitions. [2022-07-21 17:57:00,752 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 112 transitions. Word has length 17 [2022-07-21 17:57:00,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:00,752 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 112 transitions. [2022-07-21 17:57:00,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 112 transitions. [2022-07-21 17:57:00,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 17:57:00,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:00,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:57:00,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 17:57:00,755 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:00,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:00,755 INFO L85 PathProgramCache]: Analyzing trace with hash -433243261, now seen corresponding path program 1 times [2022-07-21 17:57:00,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:00,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482994541] [2022-07-21 17:57:00,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:00,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:00,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:00,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:00,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482994541] [2022-07-21 17:57:00,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482994541] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:00,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:00,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:57:00,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955286819] [2022-07-21 17:57:00,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:00,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:57:00,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:00,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:57:00,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:00,790 INFO L87 Difference]: Start difference. First operand 64 states and 112 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:00,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:00,806 INFO L93 Difference]: Finished difference Result 119 states and 210 transitions. [2022-07-21 17:57:00,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:57:00,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-21 17:57:00,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:00,808 INFO L225 Difference]: With dead ends: 119 [2022-07-21 17:57:00,808 INFO L226 Difference]: Without dead ends: 119 [2022-07-21 17:57:00,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:00,810 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 40 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:00,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 113 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:00,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-21 17:57:00,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 85. [2022-07-21 17:57:00,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 84 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:00,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 149 transitions. [2022-07-21 17:57:00,822 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 149 transitions. Word has length 17 [2022-07-21 17:57:00,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:00,827 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 149 transitions. [2022-07-21 17:57:00,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:00,828 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 149 transitions. [2022-07-21 17:57:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 17:57:00,829 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:00,829 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:57:00,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 17:57:00,830 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:00,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:00,830 INFO L85 PathProgramCache]: Analyzing trace with hash -175077823, now seen corresponding path program 1 times [2022-07-21 17:57:00,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:00,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165186231] [2022-07-21 17:57:00,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:00,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:00,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:00,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165186231] [2022-07-21 17:57:00,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165186231] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:00,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:00,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:57:00,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726928495] [2022-07-21 17:57:00,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:00,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:57:00,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:00,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:57:00,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:00,863 INFO L87 Difference]: Start difference. First operand 85 states and 149 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:00,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:00,876 INFO L93 Difference]: Finished difference Result 121 states and 208 transitions. [2022-07-21 17:57:00,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:57:00,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-21 17:57:00,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:00,877 INFO L225 Difference]: With dead ends: 121 [2022-07-21 17:57:00,878 INFO L226 Difference]: Without dead ends: 121 [2022-07-21 17:57:00,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:00,879 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:00,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 130 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:00,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-21 17:57:00,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2022-07-21 17:57:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.7542372881355932) internal successors, (207), 118 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:00,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 207 transitions. [2022-07-21 17:57:00,888 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 207 transitions. Word has length 17 [2022-07-21 17:57:00,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:00,888 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 207 transitions. [2022-07-21 17:57:00,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:00,889 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 207 transitions. [2022-07-21 17:57:00,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 17:57:00,890 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:00,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:57:00,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 17:57:00,890 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:00,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:00,891 INFO L85 PathProgramCache]: Analyzing trace with hash -545425190, now seen corresponding path program 1 times [2022-07-21 17:57:00,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:00,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980695147] [2022-07-21 17:57:00,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:00,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:00,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:00,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:00,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980695147] [2022-07-21 17:57:00,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980695147] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:00,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:00,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:57:00,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092853881] [2022-07-21 17:57:00,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:00,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:57:00,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:00,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:57:00,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:00,923 INFO L87 Difference]: Start difference. First operand 119 states and 207 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:00,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:00,942 INFO L93 Difference]: Finished difference Result 123 states and 208 transitions. [2022-07-21 17:57:00,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:57:00,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-21 17:57:00,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:00,960 INFO L225 Difference]: With dead ends: 123 [2022-07-21 17:57:00,960 INFO L226 Difference]: Without dead ends: 123 [2022-07-21 17:57:00,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:00,962 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 44 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:00,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:00,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-21 17:57:00,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2022-07-21 17:57:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.725) internal successors, (207), 120 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:00,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 207 transitions. [2022-07-21 17:57:00,969 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 207 transitions. Word has length 18 [2022-07-21 17:57:00,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:00,969 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 207 transitions. [2022-07-21 17:57:00,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:00,970 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 207 transitions. [2022-07-21 17:57:00,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 17:57:00,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:00,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:57:00,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 17:57:00,971 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:00,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:00,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1132231204, now seen corresponding path program 1 times [2022-07-21 17:57:00,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:00,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463408511] [2022-07-21 17:57:00,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:00,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:01,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:01,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:01,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463408511] [2022-07-21 17:57:01,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463408511] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:01,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:01,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:57:01,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319197520] [2022-07-21 17:57:01,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:01,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:57:01,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:01,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:57:01,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:01,009 INFO L87 Difference]: Start difference. First operand 121 states and 207 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:01,019 INFO L93 Difference]: Finished difference Result 231 states and 388 transitions. [2022-07-21 17:57:01,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:57:01,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-21 17:57:01,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:01,021 INFO L225 Difference]: With dead ends: 231 [2022-07-21 17:57:01,021 INFO L226 Difference]: Without dead ends: 231 [2022-07-21 17:57:01,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:01,022 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:01,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 115 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:01,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-21 17:57:01,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2022-07-21 17:57:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.6973684210526316) internal successors, (387), 228 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 387 transitions. [2022-07-21 17:57:01,035 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 387 transitions. Word has length 18 [2022-07-21 17:57:01,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:01,035 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 387 transitions. [2022-07-21 17:57:01,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,036 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 387 transitions. [2022-07-21 17:57:01,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 17:57:01,037 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:01,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:57:01,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 17:57:01,037 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:01,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:01,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1390396642, now seen corresponding path program 1 times [2022-07-21 17:57:01,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:01,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015274872] [2022-07-21 17:57:01,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:01,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:01,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:01,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015274872] [2022-07-21 17:57:01,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015274872] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:01,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:01,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:57:01,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125507586] [2022-07-21 17:57:01,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:01,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:57:01,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:01,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:57:01,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:01,064 INFO L87 Difference]: Start difference. First operand 229 states and 387 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:01,072 INFO L93 Difference]: Finished difference Result 287 states and 488 transitions. [2022-07-21 17:57:01,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:57:01,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-21 17:57:01,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:01,074 INFO L225 Difference]: With dead ends: 287 [2022-07-21 17:57:01,074 INFO L226 Difference]: Without dead ends: 287 [2022-07-21 17:57:01,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:01,075 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 37 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:01,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 152 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:01,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-07-21 17:57:01,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 229. [2022-07-21 17:57:01,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.6798245614035088) internal successors, (383), 228 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 383 transitions. [2022-07-21 17:57:01,086 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 383 transitions. Word has length 18 [2022-07-21 17:57:01,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:01,087 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 383 transitions. [2022-07-21 17:57:01,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,087 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 383 transitions. [2022-07-21 17:57:01,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 17:57:01,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:01,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:57:01,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 17:57:01,089 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:01,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:01,089 INFO L85 PathProgramCache]: Analyzing trace with hash -739214602, now seen corresponding path program 1 times [2022-07-21 17:57:01,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:01,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999288330] [2022-07-21 17:57:01,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:01,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:01,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:01,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999288330] [2022-07-21 17:57:01,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999288330] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:01,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:01,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:57:01,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513568188] [2022-07-21 17:57:01,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:01,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:57:01,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:01,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:57:01,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:01,114 INFO L87 Difference]: Start difference. First operand 229 states and 383 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:01,124 INFO L93 Difference]: Finished difference Result 419 states and 704 transitions. [2022-07-21 17:57:01,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:57:01,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-21 17:57:01,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:01,126 INFO L225 Difference]: With dead ends: 419 [2022-07-21 17:57:01,126 INFO L226 Difference]: Without dead ends: 419 [2022-07-21 17:57:01,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:01,127 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 34 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:01,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 109 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:01,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-07-21 17:57:01,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 321. [2022-07-21 17:57:01,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 1.646875) internal successors, (527), 320 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 527 transitions. [2022-07-21 17:57:01,138 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 527 transitions. Word has length 19 [2022-07-21 17:57:01,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:01,138 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 527 transitions. [2022-07-21 17:57:01,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,138 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 527 transitions. [2022-07-21 17:57:01,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 17:57:01,140 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:01,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:57:01,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 17:57:01,141 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:01,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:01,141 INFO L85 PathProgramCache]: Analyzing trace with hash -481049164, now seen corresponding path program 1 times [2022-07-21 17:57:01,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:01,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432382074] [2022-07-21 17:57:01,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:01,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:01,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:01,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432382074] [2022-07-21 17:57:01,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432382074] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:01,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:01,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:57:01,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192169077] [2022-07-21 17:57:01,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:01,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:57:01,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:01,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:57:01,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:01,167 INFO L87 Difference]: Start difference. First operand 321 states and 527 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:01,178 INFO L93 Difference]: Finished difference Result 443 states and 716 transitions. [2022-07-21 17:57:01,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:57:01,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-21 17:57:01,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:01,180 INFO L225 Difference]: With dead ends: 443 [2022-07-21 17:57:01,180 INFO L226 Difference]: Without dead ends: 443 [2022-07-21 17:57:01,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:01,181 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 40 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:01,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 132 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:01,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-07-21 17:57:01,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 441. [2022-07-21 17:57:01,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 1.625) internal successors, (715), 440 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 715 transitions. [2022-07-21 17:57:01,190 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 715 transitions. Word has length 19 [2022-07-21 17:57:01,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:01,191 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 715 transitions. [2022-07-21 17:57:01,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,191 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 715 transitions. [2022-07-21 17:57:01,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 17:57:01,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:01,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:57:01,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 17:57:01,193 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:01,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:01,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1440601487, now seen corresponding path program 1 times [2022-07-21 17:57:01,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:01,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554455474] [2022-07-21 17:57:01,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:01,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:01,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:01,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554455474] [2022-07-21 17:57:01,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554455474] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:01,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:01,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:57:01,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256317364] [2022-07-21 17:57:01,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:01,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:57:01,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:01,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:57:01,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:01,222 INFO L87 Difference]: Start difference. First operand 441 states and 715 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:01,241 INFO L93 Difference]: Finished difference Result 455 states and 724 transitions. [2022-07-21 17:57:01,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:57:01,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-21 17:57:01,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:01,244 INFO L225 Difference]: With dead ends: 455 [2022-07-21 17:57:01,244 INFO L226 Difference]: Without dead ends: 455 [2022-07-21 17:57:01,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:01,246 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 42 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:01,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 132 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:01,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-07-21 17:57:01,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 453. [2022-07-21 17:57:01,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.5995575221238938) internal successors, (723), 452 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 723 transitions. [2022-07-21 17:57:01,263 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 723 transitions. Word has length 20 [2022-07-21 17:57:01,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:01,264 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 723 transitions. [2022-07-21 17:57:01,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,265 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 723 transitions. [2022-07-21 17:57:01,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 17:57:01,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:01,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:57:01,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 17:57:01,269 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:01,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:01,270 INFO L85 PathProgramCache]: Analyzing trace with hash -2027407501, now seen corresponding path program 1 times [2022-07-21 17:57:01,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:01,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036676101] [2022-07-21 17:57:01,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:01,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:01,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:01,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:01,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036676101] [2022-07-21 17:57:01,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036676101] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:01,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:01,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:57:01,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90437634] [2022-07-21 17:57:01,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:01,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:57:01,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:01,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:57:01,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:01,315 INFO L87 Difference]: Start difference. First operand 453 states and 723 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:01,332 INFO L93 Difference]: Finished difference Result 807 states and 1292 transitions. [2022-07-21 17:57:01,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:57:01,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-21 17:57:01,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:01,336 INFO L225 Difference]: With dead ends: 807 [2022-07-21 17:57:01,336 INFO L226 Difference]: Without dead ends: 807 [2022-07-21 17:57:01,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:01,338 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 31 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:01,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 107 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:01,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2022-07-21 17:57:01,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 645. [2022-07-21 17:57:01,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.5574534161490683) internal successors, (1003), 644 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1003 transitions. [2022-07-21 17:57:01,357 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1003 transitions. Word has length 20 [2022-07-21 17:57:01,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:01,357 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 1003 transitions. [2022-07-21 17:57:01,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,360 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1003 transitions. [2022-07-21 17:57:01,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 17:57:01,362 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:01,362 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:57:01,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 17:57:01,362 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:01,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:01,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1769242063, now seen corresponding path program 1 times [2022-07-21 17:57:01,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:01,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060651973] [2022-07-21 17:57:01,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:01,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:01,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:01,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:01,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060651973] [2022-07-21 17:57:01,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060651973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:01,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:01,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:57:01,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321794559] [2022-07-21 17:57:01,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:01,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:57:01,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:01,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:57:01,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:01,405 INFO L87 Difference]: Start difference. First operand 645 states and 1003 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:01,419 INFO L93 Difference]: Finished difference Result 871 states and 1332 transitions. [2022-07-21 17:57:01,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:57:01,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-21 17:57:01,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:01,423 INFO L225 Difference]: With dead ends: 871 [2022-07-21 17:57:01,423 INFO L226 Difference]: Without dead ends: 871 [2022-07-21 17:57:01,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:01,426 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 39 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:01,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 133 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:01,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-07-21 17:57:01,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 869. [2022-07-21 17:57:01,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.5334101382488479) internal successors, (1331), 868 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1331 transitions. [2022-07-21 17:57:01,450 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1331 transitions. Word has length 20 [2022-07-21 17:57:01,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:01,451 INFO L495 AbstractCegarLoop]: Abstraction has 869 states and 1331 transitions. [2022-07-21 17:57:01,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,453 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1331 transitions. [2022-07-21 17:57:01,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-21 17:57:01,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:01,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:57:01,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 17:57:01,459 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:01,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:01,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1575091945, now seen corresponding path program 1 times [2022-07-21 17:57:01,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:01,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787374794] [2022-07-21 17:57:01,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:01,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:01,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:01,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787374794] [2022-07-21 17:57:01,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787374794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:01,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:01,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:57:01,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025140191] [2022-07-21 17:57:01,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:01,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:57:01,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:01,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:57:01,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:01,480 INFO L87 Difference]: Start difference. First operand 869 states and 1331 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:01,490 INFO L93 Difference]: Finished difference Result 887 states and 1332 transitions. [2022-07-21 17:57:01,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:57:01,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-21 17:57:01,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:01,494 INFO L225 Difference]: With dead ends: 887 [2022-07-21 17:57:01,494 INFO L226 Difference]: Without dead ends: 887 [2022-07-21 17:57:01,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:01,495 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 41 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:01,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:01,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2022-07-21 17:57:01,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2022-07-21 17:57:01,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 1.505656108597285) internal successors, (1331), 884 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1331 transitions. [2022-07-21 17:57:01,510 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1331 transitions. Word has length 21 [2022-07-21 17:57:01,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:01,511 INFO L495 AbstractCegarLoop]: Abstraction has 885 states and 1331 transitions. [2022-07-21 17:57:01,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,511 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1331 transitions. [2022-07-21 17:57:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-21 17:57:01,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:01,512 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:57:01,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 17:57:01,513 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:01,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:01,513 INFO L85 PathProgramCache]: Analyzing trace with hash 988285931, now seen corresponding path program 1 times [2022-07-21 17:57:01,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:01,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137041483] [2022-07-21 17:57:01,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:01,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:01,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:01,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:01,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137041483] [2022-07-21 17:57:01,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137041483] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:01,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:01,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:57:01,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358114087] [2022-07-21 17:57:01,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:01,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:57:01,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:01,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:57:01,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:01,534 INFO L87 Difference]: Start difference. First operand 885 states and 1331 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:01,546 INFO L93 Difference]: Finished difference Result 1543 states and 2324 transitions. [2022-07-21 17:57:01,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:57:01,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-21 17:57:01,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:01,551 INFO L225 Difference]: With dead ends: 1543 [2022-07-21 17:57:01,552 INFO L226 Difference]: Without dead ends: 1543 [2022-07-21 17:57:01,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:01,553 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 28 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:01,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 105 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:01,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2022-07-21 17:57:01,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1285. [2022-07-21 17:57:01,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1284 states have (on average 1.4602803738317758) internal successors, (1875), 1284 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1875 transitions. [2022-07-21 17:57:01,588 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1875 transitions. Word has length 21 [2022-07-21 17:57:01,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:01,589 INFO L495 AbstractCegarLoop]: Abstraction has 1285 states and 1875 transitions. [2022-07-21 17:57:01,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1875 transitions. [2022-07-21 17:57:01,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-21 17:57:01,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:01,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:57:01,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 17:57:01,592 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:01,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:01,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1246451369, now seen corresponding path program 1 times [2022-07-21 17:57:01,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:01,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406110869] [2022-07-21 17:57:01,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:01,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:01,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:01,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:01,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406110869] [2022-07-21 17:57:01,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406110869] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:01,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:01,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:57:01,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630558951] [2022-07-21 17:57:01,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:01,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:57:01,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:01,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:57:01,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:01,612 INFO L87 Difference]: Start difference. First operand 1285 states and 1875 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:01,627 INFO L93 Difference]: Finished difference Result 1703 states and 2436 transitions. [2022-07-21 17:57:01,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:57:01,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-21 17:57:01,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:01,633 INFO L225 Difference]: With dead ends: 1703 [2022-07-21 17:57:01,633 INFO L226 Difference]: Without dead ends: 1703 [2022-07-21 17:57:01,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:01,634 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 38 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:01,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 134 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:01,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2022-07-21 17:57:01,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1701. [2022-07-21 17:57:01,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1700 states have (on average 1.4323529411764706) internal successors, (2435), 1700 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2435 transitions. [2022-07-21 17:57:01,681 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2435 transitions. Word has length 21 [2022-07-21 17:57:01,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:01,682 INFO L495 AbstractCegarLoop]: Abstraction has 1701 states and 2435 transitions. [2022-07-21 17:57:01,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2435 transitions. [2022-07-21 17:57:01,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 17:57:01,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:01,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:57:01,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 17:57:01,685 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:01,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:01,685 INFO L85 PathProgramCache]: Analyzing trace with hash 572308166, now seen corresponding path program 1 times [2022-07-21 17:57:01,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:01,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67586993] [2022-07-21 17:57:01,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:01,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:01,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:01,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:01,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67586993] [2022-07-21 17:57:01,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67586993] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:01,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:01,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:57:01,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792390047] [2022-07-21 17:57:01,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:01,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:57:01,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:01,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:57:01,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:01,704 INFO L87 Difference]: Start difference. First operand 1701 states and 2435 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:01,718 INFO L93 Difference]: Finished difference Result 1735 states and 2436 transitions. [2022-07-21 17:57:01,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:57:01,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-21 17:57:01,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:01,724 INFO L225 Difference]: With dead ends: 1735 [2022-07-21 17:57:01,724 INFO L226 Difference]: Without dead ends: 1735 [2022-07-21 17:57:01,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:01,725 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 40 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:01,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 124 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:01,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-07-21 17:57:01,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1733. [2022-07-21 17:57:01,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1732 states have (on average 1.4058891454965359) internal successors, (2435), 1732 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2435 transitions. [2022-07-21 17:57:01,763 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2435 transitions. Word has length 22 [2022-07-21 17:57:01,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:01,763 INFO L495 AbstractCegarLoop]: Abstraction has 1733 states and 2435 transitions. [2022-07-21 17:57:01,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2435 transitions. [2022-07-21 17:57:01,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 17:57:01,765 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:01,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:57:01,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 17:57:01,766 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:01,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:01,766 INFO L85 PathProgramCache]: Analyzing trace with hash -14497848, now seen corresponding path program 1 times [2022-07-21 17:57:01,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:01,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651643305] [2022-07-21 17:57:01,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:01,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:01,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:01,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651643305] [2022-07-21 17:57:01,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651643305] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:01,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:01,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:57:01,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586711616] [2022-07-21 17:57:01,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:01,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:57:01,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:01,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:57:01,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:01,808 INFO L87 Difference]: Start difference. First operand 1733 states and 2435 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:01,828 INFO L93 Difference]: Finished difference Result 2951 states and 4132 transitions. [2022-07-21 17:57:01,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:57:01,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-21 17:57:01,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:01,837 INFO L225 Difference]: With dead ends: 2951 [2022-07-21 17:57:01,838 INFO L226 Difference]: Without dead ends: 2951 [2022-07-21 17:57:01,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:01,839 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 25 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:01,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 103 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:01,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2022-07-21 17:57:01,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2565. [2022-07-21 17:57:01,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2565 states, 2564 states have (on average 1.361544461778471) internal successors, (3491), 2564 states have internal predecessors, (3491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3491 transitions. [2022-07-21 17:57:01,888 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3491 transitions. Word has length 22 [2022-07-21 17:57:01,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:01,889 INFO L495 AbstractCegarLoop]: Abstraction has 2565 states and 3491 transitions. [2022-07-21 17:57:01,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3491 transitions. [2022-07-21 17:57:01,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 17:57:01,893 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:01,893 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:57:01,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 17:57:01,894 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:01,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:01,895 INFO L85 PathProgramCache]: Analyzing trace with hash 243667590, now seen corresponding path program 1 times [2022-07-21 17:57:01,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:01,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061671212] [2022-07-21 17:57:01,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:01,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:01,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:01,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:01,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061671212] [2022-07-21 17:57:01,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061671212] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:01,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:01,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:57:01,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391559147] [2022-07-21 17:57:01,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:01,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:57:01,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:01,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:57:01,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:01,926 INFO L87 Difference]: Start difference. First operand 2565 states and 3491 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:01,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:01,946 INFO L93 Difference]: Finished difference Result 3335 states and 4420 transitions. [2022-07-21 17:57:01,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:57:01,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-21 17:57:01,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:01,972 INFO L225 Difference]: With dead ends: 3335 [2022-07-21 17:57:01,972 INFO L226 Difference]: Without dead ends: 3335 [2022-07-21 17:57:01,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:01,973 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 37 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:01,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:01,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2022-07-21 17:57:02,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 3333. [2022-07-21 17:57:02,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3333 states, 3332 states have (on average 1.3262304921968788) internal successors, (4419), 3332 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:02,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 4419 transitions. [2022-07-21 17:57:02,025 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 4419 transitions. Word has length 22 [2022-07-21 17:57:02,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:02,025 INFO L495 AbstractCegarLoop]: Abstraction has 3333 states and 4419 transitions. [2022-07-21 17:57:02,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:02,025 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 4419 transitions. [2022-07-21 17:57:02,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-21 17:57:02,029 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:02,029 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:57:02,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-21 17:57:02,030 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:02,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:02,030 INFO L85 PathProgramCache]: Analyzing trace with hash -449217570, now seen corresponding path program 1 times [2022-07-21 17:57:02,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:02,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684746997] [2022-07-21 17:57:02,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:02,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:02,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:02,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:02,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684746997] [2022-07-21 17:57:02,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684746997] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:02,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:02,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:57:02,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541908795] [2022-07-21 17:57:02,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:02,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:57:02,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:02,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:57:02,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:02,047 INFO L87 Difference]: Start difference. First operand 3333 states and 4419 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:02,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:02,069 INFO L93 Difference]: Finished difference Result 3399 states and 4420 transitions. [2022-07-21 17:57:02,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:57:02,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-21 17:57:02,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:02,080 INFO L225 Difference]: With dead ends: 3399 [2022-07-21 17:57:02,080 INFO L226 Difference]: Without dead ends: 3399 [2022-07-21 17:57:02,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:02,084 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 39 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:02,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 120 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:02,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2022-07-21 17:57:02,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3397. [2022-07-21 17:57:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3397 states, 3396 states have (on average 1.3012367491166077) internal successors, (4419), 3396 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:02,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 3397 states and 4419 transitions. [2022-07-21 17:57:02,144 INFO L78 Accepts]: Start accepts. Automaton has 3397 states and 4419 transitions. Word has length 23 [2022-07-21 17:57:02,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:02,145 INFO L495 AbstractCegarLoop]: Abstraction has 3397 states and 4419 transitions. [2022-07-21 17:57:02,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:02,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3397 states and 4419 transitions. [2022-07-21 17:57:02,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-21 17:57:02,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:02,149 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:57:02,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-21 17:57:02,150 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:02,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:02,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1036023584, now seen corresponding path program 1 times [2022-07-21 17:57:02,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:02,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493034727] [2022-07-21 17:57:02,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:02,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:02,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:02,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:02,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493034727] [2022-07-21 17:57:02,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493034727] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:02,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:02,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:57:02,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269557143] [2022-07-21 17:57:02,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:02,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:57:02,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:02,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:57:02,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:02,184 INFO L87 Difference]: Start difference. First operand 3397 states and 4419 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:02,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:02,214 INFO L93 Difference]: Finished difference Result 5639 states and 7236 transitions. [2022-07-21 17:57:02,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:57:02,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-21 17:57:02,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:02,250 INFO L225 Difference]: With dead ends: 5639 [2022-07-21 17:57:02,250 INFO L226 Difference]: Without dead ends: 5639 [2022-07-21 17:57:02,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:02,251 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 22 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:02,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 101 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:02,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2022-07-21 17:57:02,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5125. [2022-07-21 17:57:02,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5125 states, 5124 states have (on average 1.2620999219359874) internal successors, (6467), 5124 states have internal predecessors, (6467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:02,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 6467 transitions. [2022-07-21 17:57:02,356 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 6467 transitions. Word has length 23 [2022-07-21 17:57:02,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:02,356 INFO L495 AbstractCegarLoop]: Abstraction has 5125 states and 6467 transitions. [2022-07-21 17:57:02,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:02,357 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 6467 transitions. [2022-07-21 17:57:02,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-21 17:57:02,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:02,364 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:57:02,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-21 17:57:02,364 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:02,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:02,365 INFO L85 PathProgramCache]: Analyzing trace with hash -777858146, now seen corresponding path program 1 times [2022-07-21 17:57:02,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:02,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792231449] [2022-07-21 17:57:02,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:02,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:02,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:02,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:02,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792231449] [2022-07-21 17:57:02,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792231449] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:02,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:02,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:57:02,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542827977] [2022-07-21 17:57:02,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:02,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:57:02,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:02,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:57:02,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:02,389 INFO L87 Difference]: Start difference. First operand 5125 states and 6467 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:02,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:02,444 INFO L93 Difference]: Finished difference Result 6535 states and 7940 transitions. [2022-07-21 17:57:02,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:57:02,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-21 17:57:02,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:02,453 INFO L225 Difference]: With dead ends: 6535 [2022-07-21 17:57:02,454 INFO L226 Difference]: Without dead ends: 6535 [2022-07-21 17:57:02,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:02,455 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 36 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:02,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:02,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6535 states. [2022-07-21 17:57:02,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6535 to 6533. [2022-07-21 17:57:02,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6533 states, 6532 states have (on average 1.2154011022657685) internal successors, (7939), 6532 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:02,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6533 states to 6533 states and 7939 transitions. [2022-07-21 17:57:02,594 INFO L78 Accepts]: Start accepts. Automaton has 6533 states and 7939 transitions. Word has length 23 [2022-07-21 17:57:02,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:02,595 INFO L495 AbstractCegarLoop]: Abstraction has 6533 states and 7939 transitions. [2022-07-21 17:57:02,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:02,595 INFO L276 IsEmpty]: Start isEmpty. Operand 6533 states and 7939 transitions. [2022-07-21 17:57:02,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 17:57:02,603 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:02,603 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:57:02,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-21 17:57:02,604 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:02,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:02,604 INFO L85 PathProgramCache]: Analyzing trace with hash -2051743973, now seen corresponding path program 1 times [2022-07-21 17:57:02,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:02,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387803307] [2022-07-21 17:57:02,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:02,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:02,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:02,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:02,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387803307] [2022-07-21 17:57:02,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387803307] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:02,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:02,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:57:02,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030325735] [2022-07-21 17:57:02,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:02,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:57:02,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:02,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:57:02,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:02,626 INFO L87 Difference]: Start difference. First operand 6533 states and 7939 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:02,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:02,656 INFO L93 Difference]: Finished difference Result 6663 states and 7940 transitions. [2022-07-21 17:57:02,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:57:02,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-21 17:57:02,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:02,668 INFO L225 Difference]: With dead ends: 6663 [2022-07-21 17:57:02,669 INFO L226 Difference]: Without dead ends: 6663 [2022-07-21 17:57:02,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:02,669 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 38 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:02,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 116 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:02,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6663 states. [2022-07-21 17:57:02,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6663 to 6661. [2022-07-21 17:57:02,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 6660 states have (on average 1.1920420420420421) internal successors, (7939), 6660 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 7939 transitions. [2022-07-21 17:57:02,774 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 7939 transitions. Word has length 24 [2022-07-21 17:57:02,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:02,775 INFO L495 AbstractCegarLoop]: Abstraction has 6661 states and 7939 transitions. [2022-07-21 17:57:02,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:02,775 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 7939 transitions. [2022-07-21 17:57:02,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 17:57:02,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:02,783 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:57:02,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-21 17:57:02,802 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:02,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:02,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1656417309, now seen corresponding path program 1 times [2022-07-21 17:57:02,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:02,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200111632] [2022-07-21 17:57:02,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:02,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:02,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:02,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200111632] [2022-07-21 17:57:02,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200111632] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:02,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:02,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:57:02,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912986385] [2022-07-21 17:57:02,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:02,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:57:02,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:02,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:57:02,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:02,831 INFO L87 Difference]: Start difference. First operand 6661 states and 7939 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:02,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:02,860 INFO L93 Difference]: Finished difference Result 10757 states and 12419 transitions. [2022-07-21 17:57:02,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:57:02,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-21 17:57:02,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:02,885 INFO L225 Difference]: With dead ends: 10757 [2022-07-21 17:57:02,885 INFO L226 Difference]: Without dead ends: 10757 [2022-07-21 17:57:02,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:02,886 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 18 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:02,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 98 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:02,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10757 states. [2022-07-21 17:57:03,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10757 to 10245. [2022-07-21 17:57:03,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10245 states, 10244 states have (on average 1.1623389301054277) internal successors, (11907), 10244 states have internal predecessors, (11907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:03,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10245 states to 10245 states and 11907 transitions. [2022-07-21 17:57:03,070 INFO L78 Accepts]: Start accepts. Automaton has 10245 states and 11907 transitions. Word has length 24 [2022-07-21 17:57:03,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:03,070 INFO L495 AbstractCegarLoop]: Abstraction has 10245 states and 11907 transitions. [2022-07-21 17:57:03,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:03,070 INFO L276 IsEmpty]: Start isEmpty. Operand 10245 states and 11907 transitions. [2022-07-21 17:57:03,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 17:57:03,083 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:57:03,083 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:57:03,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-21 17:57:03,083 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-21 17:57:03,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:57:03,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1914582747, now seen corresponding path program 1 times [2022-07-21 17:57:03,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:57:03,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306408355] [2022-07-21 17:57:03,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:57:03,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:57:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:57:03,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:57:03,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:57:03,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306408355] [2022-07-21 17:57:03,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306408355] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:57:03,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:57:03,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:57:03,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470806841] [2022-07-21 17:57:03,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:57:03,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:57:03,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:57:03,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:57:03,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:03,098 INFO L87 Difference]: Start difference. First operand 10245 states and 11907 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:03,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:57:03,132 INFO L93 Difference]: Finished difference Result 12803 states and 14082 transitions. [2022-07-21 17:57:03,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:57:03,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-21 17:57:03,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:57:03,132 INFO L225 Difference]: With dead ends: 12803 [2022-07-21 17:57:03,133 INFO L226 Difference]: Without dead ends: 0 [2022-07-21 17:57:03,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:57:03,133 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 34 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:57:03,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:57:03,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-21 17:57:03,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-21 17:57:03,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:03,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-21 17:57:03,135 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-07-21 17:57:03,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:57:03,135 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-21 17:57:03,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:57:03,135 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-21 17:57:03,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-21 17:57:03,137 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-07-21 17:57:03,138 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-07-21 17:57:03,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-21 17:57:03,141 INFO L356 BasicCegarLoop]: Path program 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] [2022-07-21 17:57:03,142 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 17:57:03,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 05:57:03 BoogieIcfgContainer [2022-07-21 17:57:03,145 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 17:57:03,145 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 17:57:03,145 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 17:57:03,145 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 17:57:03,146 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:56:59" (3/4) ... [2022-07-21 17:57:03,148 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-21 17:57:03,158 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-07-21 17:57:03,158 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-21 17:57:03,158 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-21 17:57:03,158 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-21 17:57:03,190 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 17:57:03,191 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 17:57:03,191 INFO L158 Benchmark]: Toolchain (without parser) took 3996.20ms. Allocated memory was 50.3MB in the beginning and 251.7MB in the end (delta: 201.3MB). Free memory was 28.1MB in the beginning and 127.5MB in the end (delta: -99.4MB). Peak memory consumption was 100.0MB. Max. memory is 16.1GB. [2022-07-21 17:57:03,191 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 50.3MB. Free memory is still 33.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:57:03,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.43ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 28.0MB in the beginning and 45.1MB in the end (delta: -17.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 17:57:03,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.37ms. Allocated memory is still 60.8MB. Free memory was 44.9MB in the beginning and 43.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:57:03,192 INFO L158 Benchmark]: Boogie Preprocessor took 44.57ms. Allocated memory is still 60.8MB. Free memory was 43.3MB in the beginning and 42.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:57:03,192 INFO L158 Benchmark]: RCFGBuilder took 416.59ms. Allocated memory is still 60.8MB. Free memory was 42.0MB in the beginning and 30.1MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 17:57:03,193 INFO L158 Benchmark]: TraceAbstraction took 3188.09ms. Allocated memory was 60.8MB in the beginning and 251.7MB in the end (delta: 190.8MB). Free memory was 29.5MB in the beginning and 130.6MB in the end (delta: -101.1MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. [2022-07-21 17:57:03,193 INFO L158 Benchmark]: Witness Printer took 45.53ms. Allocated memory is still 251.7MB. Free memory was 130.6MB in the beginning and 127.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 17:57:03,194 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 50.3MB. Free memory is still 33.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.43ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 28.0MB in the beginning and 45.1MB in the end (delta: -17.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.37ms. Allocated memory is still 60.8MB. Free memory was 44.9MB in the beginning and 43.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.57ms. Allocated memory is still 60.8MB. Free memory was 43.3MB in the beginning and 42.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 416.59ms. Allocated memory is still 60.8MB. Free memory was 42.0MB in the beginning and 30.1MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3188.09ms. Allocated memory was 60.8MB in the beginning and 251.7MB in the end (delta: 190.8MB). Free memory was 29.5MB in the beginning and 130.6MB in the end (delta: -101.1MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. * Witness Printer took 45.53ms. Allocated memory is still 251.7MB. Free memory was 130.6MB in the beginning and 127.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 149]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 974 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 974 mSDsluCounter, 3211 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1228 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 134 IncrementalHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 1983 mSDtfsCounter, 134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10245occurred in iteration=26, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 27 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 516 NumberOfCodeBlocks, 516 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 489 ConstructedInterpolants, 0 QuantifiedInterpolants, 1028 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-07-21 17:57:03,238 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: TRUE