./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/heap-manipulation/merge_sort-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version e19ca921 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/heap-manipulation/merge_sort-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 16:22:30,121 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 16:22:30,122 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 16:22:30,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 16:22:30,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 16:22:30,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 16:22:30,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 16:22:30,166 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 16:22:30,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 16:22:30,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 16:22:30,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 16:22:30,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 16:22:30,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 16:22:30,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 16:22:30,174 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 16:22:30,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 16:22:30,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 16:22:30,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 16:22:30,184 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 16:22:30,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 16:22:30,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 16:22:30,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 16:22:30,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 16:22:30,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 16:22:30,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 16:22:30,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 16:22:30,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 16:22:30,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 16:22:30,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 16:22:30,198 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 16:22:30,198 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 16:22:30,199 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 16:22:30,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 16:22:30,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 16:22:30,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 16:22:30,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 16:22:30,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 16:22:30,201 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 16:22:30,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 16:22:30,202 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 16:22:30,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 16:22:30,203 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-12-22 16:22:30,221 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 16:22:30,221 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 16:22:30,222 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 16:22:30,222 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 16:22:30,223 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 16:22:30,223 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 16:22:30,223 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 16:22:30,224 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 16:22:30,224 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 16:22:30,224 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 16:22:30,225 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 16:22:30,225 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 16:22:30,225 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 16:22:30,225 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 16:22:30,225 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 16:22:30,225 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-22 16:22:30,225 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-22 16:22:30,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 16:22:30,226 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-22 16:22:30,226 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 16:22:30,226 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 16:22:30,226 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 16:22:30,226 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 16:22:30,227 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 16:22:30,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:22:30,227 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 16:22:30,227 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 16:22:30,227 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 16:22:30,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 16:22:30,228 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 16:22:30,228 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-memcleanup) ) 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 -> 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf [2021-12-22 16:22:30,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 16:22:30,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 16:22:30,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 16:22:30,483 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 16:22:30,484 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 16:22:30,484 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2021-12-22 16:22:30,537 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca84eba2c/f05c25c3144842199c4fe6e31d751464/FLAG2e41dd93d [2021-12-22 16:22:30,893 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 16:22:30,893 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2021-12-22 16:22:30,901 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca84eba2c/f05c25c3144842199c4fe6e31d751464/FLAG2e41dd93d [2021-12-22 16:22:31,280 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca84eba2c/f05c25c3144842199c4fe6e31d751464 [2021-12-22 16:22:31,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 16:22:31,283 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 16:22:31,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 16:22:31,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 16:22:31,289 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 16:22:31,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:22:31" (1/1) ... [2021-12-22 16:22:31,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d38a66b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31, skipping insertion in model container [2021-12-22 16:22:31,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:22:31" (1/1) ... [2021-12-22 16:22:31,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 16:22:31,322 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 16:22:31,565 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/heap-manipulation/merge_sort-1.i[22632,22645] [2021-12-22 16:22:31,604 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:22:31,610 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 16:22:31,642 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/heap-manipulation/merge_sort-1.i[22632,22645] [2021-12-22 16:22:31,665 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:22:31,683 INFO L208 MainTranslator]: Completed translation [2021-12-22 16:22:31,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31 WrapperNode [2021-12-22 16:22:31,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 16:22:31,686 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 16:22:31,686 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 16:22:31,686 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 16:22:31,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31" (1/1) ... [2021-12-22 16:22:31,714 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31" (1/1) ... [2021-12-22 16:22:31,742 INFO L137 Inliner]: procedures = 125, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 294 [2021-12-22 16:22:31,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 16:22:31,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 16:22:31,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 16:22:31,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 16:22:31,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31" (1/1) ... [2021-12-22 16:22:31,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31" (1/1) ... [2021-12-22 16:22:31,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31" (1/1) ... [2021-12-22 16:22:31,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31" (1/1) ... [2021-12-22 16:22:31,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31" (1/1) ... [2021-12-22 16:22:31,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31" (1/1) ... [2021-12-22 16:22:31,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31" (1/1) ... [2021-12-22 16:22:31,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 16:22:31,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 16:22:31,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 16:22:31,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 16:22:31,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31" (1/1) ... [2021-12-22 16:22:31,807 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:22:31,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:22:31,825 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-22 16:22:31,843 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 [2021-12-22 16:22:31,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 16:22:31,854 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2021-12-22 16:22:31,855 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2021-12-22 16:22:31,855 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2021-12-22 16:22:31,855 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2021-12-22 16:22:31,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 16:22:31,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 16:22:31,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 16:22:31,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-22 16:22:31,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 16:22:31,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 16:22:31,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 16:22:31,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 16:22:31,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 16:22:31,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 16:22:31,980 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 16:22:31,981 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 16:22:32,380 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 16:22:32,387 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 16:22:32,389 INFO L299 CfgBuilder]: Removed 33 assume(true) statements. [2021-12-22 16:22:32,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:22:32 BoogieIcfgContainer [2021-12-22 16:22:32,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 16:22:32,393 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 16:22:32,393 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 16:22:32,396 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 16:22:32,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 04:22:31" (1/3) ... [2021-12-22 16:22:32,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3049749c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:22:32, skipping insertion in model container [2021-12-22 16:22:32,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31" (2/3) ... [2021-12-22 16:22:32,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3049749c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:22:32, skipping insertion in model container [2021-12-22 16:22:32,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:22:32" (3/3) ... [2021-12-22 16:22:32,400 INFO L111 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2021-12-22 16:22:32,404 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 16:22:32,404 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 105 error locations. [2021-12-22 16:22:32,436 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 16:22:32,441 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 16:22:32,441 INFO L340 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2021-12-22 16:22:32,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 262 states, 139 states have (on average 2.194244604316547) internal successors, (305), 259 states have internal predecessors, (305), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-22 16:22:32,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-22 16:22:32,471 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:32,472 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-22 16:22:32,472 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-12-22 16:22:32,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:32,476 INFO L85 PathProgramCache]: Analyzing trace with hash 56404890, now seen corresponding path program 1 times [2021-12-22 16:22:32,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:32,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861521153] [2021-12-22 16:22:32,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:32,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:32,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:32,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:32,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861521153] [2021-12-22 16:22:32,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861521153] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:32,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:32,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:22:32,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704448476] [2021-12-22 16:22:32,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:32,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-22 16:22:32,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:32,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-22 16:22:32,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-22 16:22:32,605 INFO L87 Difference]: Start difference. First operand has 262 states, 139 states have (on average 2.194244604316547) internal successors, (305), 259 states have internal predecessors, (305), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) 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) [2021-12-22 16:22:32,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:32,649 INFO L93 Difference]: Finished difference Result 260 states and 285 transitions. [2021-12-22 16:22:32,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-22 16:22:32,650 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 [2021-12-22 16:22:32,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:32,668 INFO L225 Difference]: With dead ends: 260 [2021-12-22 16:22:32,668 INFO L226 Difference]: Without dead ends: 258 [2021-12-22 16:22:32,670 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:32,673 INFO L933 BasicCegarLoop]: 285 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, 285 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 [2021-12-22 16:22:32,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:22:32,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-12-22 16:22:32,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2021-12-22 16:22:32,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 137 states have (on average 1.9416058394160585) internal successors, (266), 255 states have internal predecessors, (266), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 16:22:32,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 283 transitions. [2021-12-22 16:22:32,732 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 283 transitions. Word has length 5 [2021-12-22 16:22:32,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:32,733 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 283 transitions. [2021-12-22 16:22:32,733 INFO L471 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) [2021-12-22 16:22:32,733 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 283 transitions. [2021-12-22 16:22:32,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-22 16:22:32,747 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:32,747 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-22 16:22:32,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 16:22:32,748 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-12-22 16:22:32,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:32,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1747491005, now seen corresponding path program 1 times [2021-12-22 16:22:32,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:32,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894842098] [2021-12-22 16:22:32,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:32,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:32,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:32,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:32,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894842098] [2021-12-22 16:22:32,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894842098] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:32,787 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:32,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:22:32,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009840125] [2021-12-22 16:22:32,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:32,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:22:32,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:32,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:22:32,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:22:32,790 INFO L87 Difference]: Start difference. First operand 258 states and 283 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) [2021-12-22 16:22:33,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:33,003 INFO L93 Difference]: Finished difference Result 391 states and 435 transitions. [2021-12-22 16:22:33,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:22:33,004 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 [2021-12-22 16:22:33,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:33,006 INFO L225 Difference]: With dead ends: 391 [2021-12-22 16:22:33,006 INFO L226 Difference]: Without dead ends: 390 [2021-12-22 16:22:33,009 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:33,010 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 133 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:33,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 396 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:22:33,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-12-22 16:22:33,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 261. [2021-12-22 16:22:33,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 140 states have (on average 1.9285714285714286) internal successors, (270), 258 states have internal predecessors, (270), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 16:22:33,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 287 transitions. [2021-12-22 16:22:33,024 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 287 transitions. Word has length 6 [2021-12-22 16:22:33,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:33,026 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 287 transitions. [2021-12-22 16:22:33,027 INFO L471 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) [2021-12-22 16:22:33,027 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 287 transitions. [2021-12-22 16:22:33,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-22 16:22:33,028 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:33,028 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-22 16:22:33,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 16:22:33,028 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-12-22 16:22:33,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:33,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1747491563, now seen corresponding path program 1 times [2021-12-22 16:22:33,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:33,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583786454] [2021-12-22 16:22:33,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:33,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:33,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:33,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:33,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583786454] [2021-12-22 16:22:33,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583786454] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:33,094 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:33,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:22:33,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022900807] [2021-12-22 16:22:33,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:33,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:22:33,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:33,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:22:33,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:22:33,096 INFO L87 Difference]: Start difference. First operand 261 states and 287 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) [2021-12-22 16:22:33,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:33,257 INFO L93 Difference]: Finished difference Result 439 states and 489 transitions. [2021-12-22 16:22:33,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:22:33,258 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 [2021-12-22 16:22:33,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:33,259 INFO L225 Difference]: With dead ends: 439 [2021-12-22 16:22:33,259 INFO L226 Difference]: Without dead ends: 439 [2021-12-22 16:22:33,260 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:33,260 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 199 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:33,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 569 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:33,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2021-12-22 16:22:33,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 259. [2021-12-22 16:22:33,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 140 states have (on average 1.9142857142857144) internal successors, (268), 256 states have internal predecessors, (268), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 16:22:33,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 285 transitions. [2021-12-22 16:22:33,267 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 285 transitions. Word has length 6 [2021-12-22 16:22:33,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:33,267 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 285 transitions. [2021-12-22 16:22:33,267 INFO L471 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) [2021-12-22 16:22:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 285 transitions. [2021-12-22 16:22:33,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-22 16:22:33,267 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:33,268 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-22 16:22:33,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 16:22:33,268 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-12-22 16:22:33,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:33,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1747491564, now seen corresponding path program 1 times [2021-12-22 16:22:33,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:33,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089147949] [2021-12-22 16:22:33,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:33,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:33,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:33,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:33,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089147949] [2021-12-22 16:22:33,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089147949] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:33,298 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:33,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:22:33,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719682423] [2021-12-22 16:22:33,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:33,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:22:33,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:33,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:22:33,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:22:33,300 INFO L87 Difference]: Start difference. First operand 259 states and 285 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) [2021-12-22 16:22:33,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:33,446 INFO L93 Difference]: Finished difference Result 400 states and 444 transitions. [2021-12-22 16:22:33,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:22:33,446 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 [2021-12-22 16:22:33,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:33,447 INFO L225 Difference]: With dead ends: 400 [2021-12-22 16:22:33,448 INFO L226 Difference]: Without dead ends: 400 [2021-12-22 16:22:33,448 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:33,448 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 162 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:33,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 560 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:33,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-12-22 16:22:33,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 257. [2021-12-22 16:22:33,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 140 states have (on average 1.9) internal successors, (266), 254 states have internal predecessors, (266), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 16:22:33,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 283 transitions. [2021-12-22 16:22:33,453 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 283 transitions. Word has length 6 [2021-12-22 16:22:33,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:33,453 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 283 transitions. [2021-12-22 16:22:33,454 INFO L471 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) [2021-12-22 16:22:33,454 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 283 transitions. [2021-12-22 16:22:33,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-22 16:22:33,454 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:33,454 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:33,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 16:22:33,455 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-12-22 16:22:33,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:33,455 INFO L85 PathProgramCache]: Analyzing trace with hash 6274696, now seen corresponding path program 1 times [2021-12-22 16:22:33,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:33,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214760995] [2021-12-22 16:22:33,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:33,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:33,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:33,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:33,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214760995] [2021-12-22 16:22:33,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214760995] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:33,475 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:33,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 16:22:33,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058374296] [2021-12-22 16:22:33,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:33,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:22:33,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:33,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:22:33,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:22:33,476 INFO L87 Difference]: Start difference. First operand 257 states and 283 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:33,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:33,493 INFO L93 Difference]: Finished difference Result 272 states and 296 transitions. [2021-12-22 16:22:33,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:22:33,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-22 16:22:33,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:33,494 INFO L225 Difference]: With dead ends: 272 [2021-12-22 16:22:33,494 INFO L226 Difference]: Without dead ends: 271 [2021-12-22 16:22:33,495 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:33,495 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 14 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:33,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 537 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:22:33,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-12-22 16:22:33,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 256. [2021-12-22 16:22:33,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 139 states have (on average 1.8992805755395683) internal successors, (264), 253 states have internal predecessors, (264), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 16:22:33,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 281 transitions. [2021-12-22 16:22:33,506 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 281 transitions. Word has length 8 [2021-12-22 16:22:33,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:33,506 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 281 transitions. [2021-12-22 16:22:33,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 281 transitions. [2021-12-22 16:22:33,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-22 16:22:33,507 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:33,507 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:33,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 16:22:33,507 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-12-22 16:22:33,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:33,508 INFO L85 PathProgramCache]: Analyzing trace with hash -849555632, now seen corresponding path program 1 times [2021-12-22 16:22:33,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:33,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109092854] [2021-12-22 16:22:33,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:33,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:33,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:33,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109092854] [2021-12-22 16:22:33,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109092854] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:33,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:33,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:22:33,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330009095] [2021-12-22 16:22:33,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:33,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:22:33,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:33,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:22:33,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:22:33,544 INFO L87 Difference]: Start difference. First operand 256 states and 281 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:33,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:33,669 INFO L93 Difference]: Finished difference Result 342 states and 375 transitions. [2021-12-22 16:22:33,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:22:33,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-12-22 16:22:33,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:33,671 INFO L225 Difference]: With dead ends: 342 [2021-12-22 16:22:33,671 INFO L226 Difference]: Without dead ends: 342 [2021-12-22 16:22:33,671 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:33,672 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 160 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:33,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 346 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:33,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-12-22 16:22:33,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 254. [2021-12-22 16:22:33,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 139 states have (on average 1.8848920863309353) internal successors, (262), 251 states have internal predecessors, (262), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 16:22:33,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 279 transitions. [2021-12-22 16:22:33,676 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 279 transitions. Word has length 11 [2021-12-22 16:22:33,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:33,677 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 279 transitions. [2021-12-22 16:22:33,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:33,677 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 279 transitions. [2021-12-22 16:22:33,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-22 16:22:33,677 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:33,677 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:33,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 16:22:33,678 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-12-22 16:22:33,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:33,678 INFO L85 PathProgramCache]: Analyzing trace with hash -849555633, now seen corresponding path program 1 times [2021-12-22 16:22:33,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:33,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303386734] [2021-12-22 16:22:33,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:33,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:33,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:33,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303386734] [2021-12-22 16:22:33,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303386734] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:33,708 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:33,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:22:33,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235005380] [2021-12-22 16:22:33,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:33,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:22:33,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:33,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:22:33,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:22:33,709 INFO L87 Difference]: Start difference. First operand 254 states and 279 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:33,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:33,832 INFO L93 Difference]: Finished difference Result 377 states and 416 transitions. [2021-12-22 16:22:33,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:22:33,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-12-22 16:22:33,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:33,835 INFO L225 Difference]: With dead ends: 377 [2021-12-22 16:22:33,835 INFO L226 Difference]: Without dead ends: 377 [2021-12-22 16:22:33,847 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:33,848 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 193 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:33,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 312 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:33,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-12-22 16:22:33,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 252. [2021-12-22 16:22:33,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 139 states have (on average 1.870503597122302) internal successors, (260), 249 states have internal predecessors, (260), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 16:22:33,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 277 transitions. [2021-12-22 16:22:33,864 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 277 transitions. Word has length 11 [2021-12-22 16:22:33,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:33,865 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 277 transitions. [2021-12-22 16:22:33,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:33,865 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 277 transitions. [2021-12-22 16:22:33,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-22 16:22:33,865 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:33,865 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:33,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 16:22:33,866 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-12-22 16:22:33,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:33,866 INFO L85 PathProgramCache]: Analyzing trace with hash 321246795, now seen corresponding path program 1 times [2021-12-22 16:22:33,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:33,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842169610] [2021-12-22 16:22:33,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:33,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:33,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:33,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:33,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842169610] [2021-12-22 16:22:33,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842169610] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:33,942 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:33,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:22:33,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009669050] [2021-12-22 16:22:33,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:33,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 16:22:33,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:33,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 16:22:33,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:22:33,943 INFO L87 Difference]: Start difference. First operand 252 states and 277 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) [2021-12-22 16:22:33,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:33,984 INFO L93 Difference]: Finished difference Result 407 states and 447 transitions. [2021-12-22 16:22:33,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 16:22:33,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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 [2021-12-22 16:22:33,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:33,985 INFO L225 Difference]: With dead ends: 407 [2021-12-22 16:22:33,985 INFO L226 Difference]: Without dead ends: 407 [2021-12-22 16:22:33,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:22:33,986 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 602 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:33,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [604 Valid, 508 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:22:33,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-12-22 16:22:33,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 252. [2021-12-22 16:22:33,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 139 states have (on average 1.8633093525179856) internal successors, (259), 249 states have internal predecessors, (259), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 16:22:33,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 276 transitions. [2021-12-22 16:22:33,991 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 276 transitions. Word has length 17 [2021-12-22 16:22:33,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:33,991 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 276 transitions. [2021-12-22 16:22:33,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) [2021-12-22 16:22:33,992 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 276 transitions. [2021-12-22 16:22:33,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-22 16:22:33,992 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:33,992 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:33,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 16:22:33,992 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-12-22 16:22:33,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:33,993 INFO L85 PathProgramCache]: Analyzing trace with hash -519843690, now seen corresponding path program 1 times [2021-12-22 16:22:33,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:33,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277890684] [2021-12-22 16:22:33,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:33,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:34,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:34,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:34,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277890684] [2021-12-22 16:22:34,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277890684] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:34,026 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:34,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:22:34,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108683747] [2021-12-22 16:22:34,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:34,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:22:34,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:34,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:22:34,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:22:34,027 INFO L87 Difference]: Start difference. First operand 252 states and 276 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:34,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:34,141 INFO L93 Difference]: Finished difference Result 714 states and 789 transitions. [2021-12-22 16:22:34,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:22:34,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-22 16:22:34,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:34,143 INFO L225 Difference]: With dead ends: 714 [2021-12-22 16:22:34,144 INFO L226 Difference]: Without dead ends: 714 [2021-12-22 16:22:34,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:22:34,144 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 1478 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:34,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1480 Valid, 705 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:34,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2021-12-22 16:22:34,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 280. [2021-12-22 16:22:34,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 168 states have (on average 1.8571428571428572) internal successors, (312), 277 states have internal predecessors, (312), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 16:22:34,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 328 transitions. [2021-12-22 16:22:34,150 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 328 transitions. Word has length 19 [2021-12-22 16:22:34,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:34,151 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 328 transitions. [2021-12-22 16:22:34,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:34,151 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 328 transitions. [2021-12-22 16:22:34,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-22 16:22:34,151 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:34,152 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:34,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-22 16:22:34,152 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-12-22 16:22:34,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:34,152 INFO L85 PathProgramCache]: Analyzing trace with hash -519854939, now seen corresponding path program 1 times [2021-12-22 16:22:34,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:34,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488573675] [2021-12-22 16:22:34,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:34,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:34,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:34,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:34,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488573675] [2021-12-22 16:22:34,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488573675] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:34,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:34,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:22:34,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848983098] [2021-12-22 16:22:34,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:34,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:22:34,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:34,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:22:34,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:22:34,185 INFO L87 Difference]: Start difference. First operand 280 states and 328 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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) [2021-12-22 16:22:34,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:34,478 INFO L93 Difference]: Finished difference Result 466 states and 533 transitions. [2021-12-22 16:22:34,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:22:34,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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 [2021-12-22 16:22:34,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:34,480 INFO L225 Difference]: With dead ends: 466 [2021-12-22 16:22:34,480 INFO L226 Difference]: Without dead ends: 466 [2021-12-22 16:22:34,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:22:34,481 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 646 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:34,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [648 Valid, 547 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 16:22:34,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2021-12-22 16:22:34,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 271. [2021-12-22 16:22:34,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 168 states have (on average 1.7857142857142858) internal successors, (300), 268 states have internal predecessors, (300), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 16:22:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 316 transitions. [2021-12-22 16:22:34,485 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 316 transitions. Word has length 19 [2021-12-22 16:22:34,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:34,486 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 316 transitions. [2021-12-22 16:22:34,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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) [2021-12-22 16:22:34,486 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 316 transitions. [2021-12-22 16:22:34,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-22 16:22:34,486 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:34,486 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:34,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-22 16:22:34,486 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-12-22 16:22:34,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:34,487 INFO L85 PathProgramCache]: Analyzing trace with hash -519854938, now seen corresponding path program 1 times [2021-12-22 16:22:34,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:34,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795347884] [2021-12-22 16:22:34,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:34,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:34,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:34,527 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:34,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795347884] [2021-12-22 16:22:34,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795347884] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:34,527 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:34,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:22:34,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5358868] [2021-12-22 16:22:34,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:34,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:22:34,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:34,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:22:34,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:22:34,529 INFO L87 Difference]: Start difference. First operand 271 states and 316 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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) [2021-12-22 16:22:34,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:34,817 INFO L93 Difference]: Finished difference Result 606 states and 668 transitions. [2021-12-22 16:22:34,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:22:34,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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 [2021-12-22 16:22:34,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:34,820 INFO L225 Difference]: With dead ends: 606 [2021-12-22 16:22:34,820 INFO L226 Difference]: Without dead ends: 606 [2021-12-22 16:22:34,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:22:34,820 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 891 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:34,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [891 Valid, 571 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:22:34,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2021-12-22 16:22:34,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 291. [2021-12-22 16:22:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 188 states have (on average 1.7234042553191489) internal successors, (324), 288 states have internal predecessors, (324), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 16:22:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 340 transitions. [2021-12-22 16:22:34,826 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 340 transitions. Word has length 19 [2021-12-22 16:22:34,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:34,826 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 340 transitions. [2021-12-22 16:22:34,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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) [2021-12-22 16:22:34,826 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 340 transitions. [2021-12-22 16:22:34,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-22 16:22:34,827 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:34,827 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:34,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-22 16:22:34,828 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-12-22 16:22:34,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:34,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1987558854, now seen corresponding path program 1 times [2021-12-22 16:22:34,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:34,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740172741] [2021-12-22 16:22:34,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:34,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:34,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-22 16:22:34,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:34,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740172741] [2021-12-22 16:22:34,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740172741] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:34,872 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:34,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:22:34,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926938405] [2021-12-22 16:22:34,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:34,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:22:34,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:34,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:22:34,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:22:34,873 INFO L87 Difference]: Start difference. First operand 291 states and 340 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:34,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:34,988 INFO L93 Difference]: Finished difference Result 373 states and 428 transitions. [2021-12-22 16:22:34,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 16:22:34,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-22 16:22:34,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:34,989 INFO L225 Difference]: With dead ends: 373 [2021-12-22 16:22:34,990 INFO L226 Difference]: Without dead ends: 373 [2021-12-22 16:22:34,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:22:34,990 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 103 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:34,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 838 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:34,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-12-22 16:22:34,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 290. [2021-12-22 16:22:34,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 188 states have (on average 1.7127659574468086) internal successors, (322), 287 states have internal predecessors, (322), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 16:22:34,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 337 transitions. [2021-12-22 16:22:34,996 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 337 transitions. Word has length 26 [2021-12-22 16:22:34,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:34,996 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 337 transitions. [2021-12-22 16:22:34,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:34,996 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 337 transitions. [2021-12-22 16:22:34,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-22 16:22:34,997 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:34,997 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:34,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-22 16:22:34,997 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-12-22 16:22:34,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:34,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1626991364, now seen corresponding path program 1 times [2021-12-22 16:22:34,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:34,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748078039] [2021-12-22 16:22:34,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:34,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:35,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-22 16:22:35,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:35,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748078039] [2021-12-22 16:22:35,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748078039] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:35,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:35,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:22:35,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157182618] [2021-12-22 16:22:35,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:35,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:22:35,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:35,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:22:35,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:22:35,044 INFO L87 Difference]: Start difference. First operand 290 states and 337 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:35,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:35,139 INFO L93 Difference]: Finished difference Result 289 states and 334 transitions. [2021-12-22 16:22:35,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 16:22:35,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-22 16:22:35,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:35,140 INFO L225 Difference]: With dead ends: 289 [2021-12-22 16:22:35,141 INFO L226 Difference]: Without dead ends: 289 [2021-12-22 16:22:35,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:22:35,141 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 19 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:35,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 863 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:35,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-12-22 16:22:35,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2021-12-22 16:22:35,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 188 states have (on average 1.702127659574468) internal successors, (320), 286 states have internal predecessors, (320), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 16:22:35,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 334 transitions. [2021-12-22 16:22:35,146 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 334 transitions. Word has length 26 [2021-12-22 16:22:35,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:35,146 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 334 transitions. [2021-12-22 16:22:35,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:35,147 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 334 transitions. [2021-12-22 16:22:35,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-22 16:22:35,147 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:35,147 INFO L514 BasicCegarLoop]: trace histogram [2, 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] [2021-12-22 16:22:35,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-22 16:22:35,148 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-12-22 16:22:35,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:35,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1169692160, now seen corresponding path program 1 times [2021-12-22 16:22:35,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:35,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754119388] [2021-12-22 16:22:35,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:35,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:35,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:35,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:35,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754119388] [2021-12-22 16:22:35,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754119388] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:35,195 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:35,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 16:22:35,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958832158] [2021-12-22 16:22:35,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:35,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 16:22:35,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:35,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 16:22:35,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:22:35,196 INFO L87 Difference]: Start difference. First operand 289 states and 334 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:35,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:35,407 INFO L93 Difference]: Finished difference Result 604 states and 661 transitions. [2021-12-22 16:22:35,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 16:22:35,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-22 16:22:35,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:35,409 INFO L225 Difference]: With dead ends: 604 [2021-12-22 16:22:35,409 INFO L226 Difference]: Without dead ends: 604 [2021-12-22 16:22:35,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-12-22 16:22:35,409 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 1281 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:35,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1283 Valid, 1040 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:22:35,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2021-12-22 16:22:35,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 289. [2021-12-22 16:22:35,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 188 states have (on average 1.696808510638298) internal successors, (319), 286 states have internal predecessors, (319), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 16:22:35,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 333 transitions. [2021-12-22 16:22:35,415 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 333 transitions. Word has length 29 [2021-12-22 16:22:35,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:35,415 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 333 transitions. [2021-12-22 16:22:35,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:35,416 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 333 transitions. [2021-12-22 16:22:35,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-22 16:22:35,416 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:35,416 INFO L514 BasicCegarLoop]: trace histogram [2, 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] [2021-12-22 16:22:35,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-22 16:22:35,417 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-12-22 16:22:35,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:35,417 INFO L85 PathProgramCache]: Analyzing trace with hash 698957523, now seen corresponding path program 1 times [2021-12-22 16:22:35,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:35,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209174870] [2021-12-22 16:22:35,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:35,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:35,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:35,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:35,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209174870] [2021-12-22 16:22:35,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209174870] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:35,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:35,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 16:22:35,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991864815] [2021-12-22 16:22:35,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:35,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 16:22:35,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:35,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 16:22:35,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:22:35,469 INFO L87 Difference]: Start difference. First operand 289 states and 333 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:35,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:35,682 INFO L93 Difference]: Finished difference Result 603 states and 659 transitions. [2021-12-22 16:22:35,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 16:22:35,683 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-22 16:22:35,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:35,684 INFO L225 Difference]: With dead ends: 603 [2021-12-22 16:22:35,685 INFO L226 Difference]: Without dead ends: 603 [2021-12-22 16:22:35,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-12-22 16:22:35,685 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 1277 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:35,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1279 Valid, 1040 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:22:35,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2021-12-22 16:22:35,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 289. [2021-12-22 16:22:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 188 states have (on average 1.6914893617021276) internal successors, (318), 286 states have internal predecessors, (318), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 16:22:35,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 332 transitions. [2021-12-22 16:22:35,690 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 332 transitions. Word has length 29 [2021-12-22 16:22:35,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:35,690 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 332 transitions. [2021-12-22 16:22:35,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:35,690 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 332 transitions. [2021-12-22 16:22:35,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-22 16:22:35,690 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:35,691 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:35,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-22 16:22:35,691 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-12-22 16:22:35,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:35,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1900933732, now seen corresponding path program 1 times [2021-12-22 16:22:35,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:35,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573269621] [2021-12-22 16:22:35,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:35,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:35,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:35,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:35,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573269621] [2021-12-22 16:22:35,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573269621] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:35,771 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:35,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 16:22:35,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351648035] [2021-12-22 16:22:35,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:35,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:22:35,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:35,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:22:35,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:22:35,772 INFO L87 Difference]: Start difference. First operand 289 states and 332 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:36,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:36,252 INFO L93 Difference]: Finished difference Result 676 states and 747 transitions. [2021-12-22 16:22:36,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 16:22:36,252 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2021-12-22 16:22:36,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:36,254 INFO L225 Difference]: With dead ends: 676 [2021-12-22 16:22:36,254 INFO L226 Difference]: Without dead ends: 676 [2021-12-22 16:22:36,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2021-12-22 16:22:36,255 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 1266 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:36,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1268 Valid, 916 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 16:22:36,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2021-12-22 16:22:36,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 290. [2021-12-22 16:22:36,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 189 states have (on average 1.693121693121693) internal successors, (320), 287 states have internal predecessors, (320), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 16:22:36,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 334 transitions. [2021-12-22 16:22:36,271 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 334 transitions. Word has length 30 [2021-12-22 16:22:36,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:36,272 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 334 transitions. [2021-12-22 16:22:36,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:36,272 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 334 transitions. [2021-12-22 16:22:36,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-22 16:22:36,272 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:36,272 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:36,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-22 16:22:36,273 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-12-22 16:22:36,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:36,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1900933731, now seen corresponding path program 1 times [2021-12-22 16:22:36,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:36,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088812722] [2021-12-22 16:22:36,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:36,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:36,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:36,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088812722] [2021-12-22 16:22:36,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088812722] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:36,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:36,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 16:22:36,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702818585] [2021-12-22 16:22:36,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:36,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:22:36,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:36,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:22:36,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:22:36,364 INFO L87 Difference]: Start difference. First operand 290 states and 334 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:37,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:37,090 INFO L93 Difference]: Finished difference Result 801 states and 880 transitions. [2021-12-22 16:22:37,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 16:22:37,090 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2021-12-22 16:22:37,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:37,093 INFO L225 Difference]: With dead ends: 801 [2021-12-22 16:22:37,093 INFO L226 Difference]: Without dead ends: 801 [2021-12-22 16:22:37,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2021-12-22 16:22:37,094 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 1637 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1637 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:37,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1637 Valid, 886 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-22 16:22:37,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2021-12-22 16:22:37,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 290. [2021-12-22 16:22:37,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 189 states have (on average 1.687830687830688) internal successors, (319), 287 states have internal predecessors, (319), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 16:22:37,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 333 transitions. [2021-12-22 16:22:37,099 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 333 transitions. Word has length 30 [2021-12-22 16:22:37,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:37,099 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 333 transitions. [2021-12-22 16:22:37,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:37,100 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 333 transitions. [2021-12-22 16:22:37,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-22 16:22:37,100 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:37,100 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:37,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-22 16:22:37,101 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-12-22 16:22:37,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:37,101 INFO L85 PathProgramCache]: Analyzing trace with hash 192556862, now seen corresponding path program 1 times [2021-12-22 16:22:37,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:37,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544215915] [2021-12-22 16:22:37,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:37,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:37,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:37,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:37,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544215915] [2021-12-22 16:22:37,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544215915] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:37,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:37,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 16:22:37,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975036690] [2021-12-22 16:22:37,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:37,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:22:37,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:37,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:22:37,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:22:37,191 INFO L87 Difference]: Start difference. First operand 290 states and 333 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:37,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:37,670 INFO L93 Difference]: Finished difference Result 674 states and 745 transitions. [2021-12-22 16:22:37,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 16:22:37,671 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2021-12-22 16:22:37,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:37,673 INFO L225 Difference]: With dead ends: 674 [2021-12-22 16:22:37,673 INFO L226 Difference]: Without dead ends: 674 [2021-12-22 16:22:37,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2021-12-22 16:22:37,673 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 1442 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:37,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1444 Valid, 985 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 16:22:37,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2021-12-22 16:22:37,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 290. [2021-12-22 16:22:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 189 states have (on average 1.6825396825396826) internal successors, (318), 287 states have internal predecessors, (318), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 16:22:37,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 332 transitions. [2021-12-22 16:22:37,678 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 332 transitions. Word has length 30 [2021-12-22 16:22:37,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:37,678 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 332 transitions. [2021-12-22 16:22:37,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:37,678 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 332 transitions. [2021-12-22 16:22:37,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-22 16:22:37,679 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:37,679 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:37,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-22 16:22:37,679 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-12-22 16:22:37,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:37,679 INFO L85 PathProgramCache]: Analyzing trace with hash 192556863, now seen corresponding path program 1 times [2021-12-22 16:22:37,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:37,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900137457] [2021-12-22 16:22:37,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:37,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:37,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:37,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900137457] [2021-12-22 16:22:37,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900137457] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:37,790 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:37,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 16:22:37,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679297807] [2021-12-22 16:22:37,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:37,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:22:37,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:37,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:22:37,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:22:37,792 INFO L87 Difference]: Start difference. First operand 290 states and 332 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:38,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:38,481 INFO L93 Difference]: Finished difference Result 799 states and 878 transitions. [2021-12-22 16:22:38,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 16:22:38,482 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2021-12-22 16:22:38,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:38,484 INFO L225 Difference]: With dead ends: 799 [2021-12-22 16:22:38,484 INFO L226 Difference]: Without dead ends: 799 [2021-12-22 16:22:38,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2021-12-22 16:22:38,484 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 1628 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:38,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1628 Valid, 861 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-22 16:22:38,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2021-12-22 16:22:38,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 290. [2021-12-22 16:22:38,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 189 states have (on average 1.6772486772486772) internal successors, (317), 287 states have internal predecessors, (317), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 16:22:38,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 331 transitions. [2021-12-22 16:22:38,490 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 331 transitions. Word has length 30 [2021-12-22 16:22:38,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:38,491 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 331 transitions. [2021-12-22 16:22:38,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:38,491 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 331 transitions. [2021-12-22 16:22:38,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-22 16:22:38,492 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:38,492 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:38,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-22 16:22:38,492 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-12-22 16:22:38,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:38,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1572782387, now seen corresponding path program 1 times [2021-12-22 16:22:38,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:38,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233864845] [2021-12-22 16:22:38,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:38,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 16:22:38,513 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 16:22:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 16:22:38,556 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 16:22:38,557 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-22 16:22:38,557 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONMEMORY_LEAK (104 of 105 remaining) [2021-12-22 16:22:38,559 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr0REQUIRES_VIOLATION (103 of 105 remaining) [2021-12-22 16:22:38,559 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr1REQUIRES_VIOLATION (102 of 105 remaining) [2021-12-22 16:22:38,559 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr2REQUIRES_VIOLATION (101 of 105 remaining) [2021-12-22 16:22:38,559 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr3REQUIRES_VIOLATION (100 of 105 remaining) [2021-12-22 16:22:38,559 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr4REQUIRES_VIOLATION (99 of 105 remaining) [2021-12-22 16:22:38,559 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr5REQUIRES_VIOLATION (98 of 105 remaining) [2021-12-22 16:22:38,559 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr6REQUIRES_VIOLATION (97 of 105 remaining) [2021-12-22 16:22:38,559 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr7REQUIRES_VIOLATION (96 of 105 remaining) [2021-12-22 16:22:38,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr8REQUIRES_VIOLATION (95 of 105 remaining) [2021-12-22 16:22:38,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr9REQUIRES_VIOLATION (94 of 105 remaining) [2021-12-22 16:22:38,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr10REQUIRES_VIOLATION (93 of 105 remaining) [2021-12-22 16:22:38,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr11REQUIRES_VIOLATION (92 of 105 remaining) [2021-12-22 16:22:38,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr12REQUIRES_VIOLATION (91 of 105 remaining) [2021-12-22 16:22:38,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr13REQUIRES_VIOLATION (90 of 105 remaining) [2021-12-22 16:22:38,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (89 of 105 remaining) [2021-12-22 16:22:38,561 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (88 of 105 remaining) [2021-12-22 16:22:38,561 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (87 of 105 remaining) [2021-12-22 16:22:38,561 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (86 of 105 remaining) [2021-12-22 16:22:38,561 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (85 of 105 remaining) [2021-12-22 16:22:38,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (84 of 105 remaining) [2021-12-22 16:22:38,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (83 of 105 remaining) [2021-12-22 16:22:38,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (82 of 105 remaining) [2021-12-22 16:22:38,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (81 of 105 remaining) [2021-12-22 16:22:38,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (80 of 105 remaining) [2021-12-22 16:22:38,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (79 of 105 remaining) [2021-12-22 16:22:38,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (78 of 105 remaining) [2021-12-22 16:22:38,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (77 of 105 remaining) [2021-12-22 16:22:38,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (76 of 105 remaining) [2021-12-22 16:22:38,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (75 of 105 remaining) [2021-12-22 16:22:38,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (74 of 105 remaining) [2021-12-22 16:22:38,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (73 of 105 remaining) [2021-12-22 16:22:38,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (72 of 105 remaining) [2021-12-22 16:22:38,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (71 of 105 remaining) [2021-12-22 16:22:38,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (70 of 105 remaining) [2021-12-22 16:22:38,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (69 of 105 remaining) [2021-12-22 16:22:38,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (68 of 105 remaining) [2021-12-22 16:22:38,564 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (67 of 105 remaining) [2021-12-22 16:22:38,564 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (66 of 105 remaining) [2021-12-22 16:22:38,564 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (65 of 105 remaining) [2021-12-22 16:22:38,564 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (64 of 105 remaining) [2021-12-22 16:22:38,564 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (63 of 105 remaining) [2021-12-22 16:22:38,564 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (62 of 105 remaining) [2021-12-22 16:22:38,564 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (61 of 105 remaining) [2021-12-22 16:22:38,564 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (60 of 105 remaining) [2021-12-22 16:22:38,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (59 of 105 remaining) [2021-12-22 16:22:38,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (58 of 105 remaining) [2021-12-22 16:22:38,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (57 of 105 remaining) [2021-12-22 16:22:38,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (56 of 105 remaining) [2021-12-22 16:22:38,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (55 of 105 remaining) [2021-12-22 16:22:38,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (54 of 105 remaining) [2021-12-22 16:22:38,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (53 of 105 remaining) [2021-12-22 16:22:38,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (52 of 105 remaining) [2021-12-22 16:22:38,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (51 of 105 remaining) [2021-12-22 16:22:38,566 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (50 of 105 remaining) [2021-12-22 16:22:38,566 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (49 of 105 remaining) [2021-12-22 16:22:38,567 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (48 of 105 remaining) [2021-12-22 16:22:38,567 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (47 of 105 remaining) [2021-12-22 16:22:38,567 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION (46 of 105 remaining) [2021-12-22 16:22:38,568 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION (45 of 105 remaining) [2021-12-22 16:22:38,568 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (44 of 105 remaining) [2021-12-22 16:22:38,568 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (43 of 105 remaining) [2021-12-22 16:22:38,568 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION (42 of 105 remaining) [2021-12-22 16:22:38,568 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION (41 of 105 remaining) [2021-12-22 16:22:38,568 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (40 of 105 remaining) [2021-12-22 16:22:38,568 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION (39 of 105 remaining) [2021-12-22 16:22:38,568 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION (38 of 105 remaining) [2021-12-22 16:22:38,568 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION (37 of 105 remaining) [2021-12-22 16:22:38,569 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION (36 of 105 remaining) [2021-12-22 16:22:38,569 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION (35 of 105 remaining) [2021-12-22 16:22:38,569 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION (34 of 105 remaining) [2021-12-22 16:22:38,569 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION (33 of 105 remaining) [2021-12-22 16:22:38,569 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION (32 of 105 remaining) [2021-12-22 16:22:38,569 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION (31 of 105 remaining) [2021-12-22 16:22:38,569 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION (30 of 105 remaining) [2021-12-22 16:22:38,569 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION (29 of 105 remaining) [2021-12-22 16:22:38,570 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION (28 of 105 remaining) [2021-12-22 16:22:38,570 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION (27 of 105 remaining) [2021-12-22 16:22:38,570 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATION (26 of 105 remaining) [2021-12-22 16:22:38,570 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE (25 of 105 remaining) [2021-12-22 16:22:38,570 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE (24 of 105 remaining) [2021-12-22 16:22:38,570 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE (23 of 105 remaining) [2021-12-22 16:22:38,570 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION (22 of 105 remaining) [2021-12-22 16:22:38,571 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATION (21 of 105 remaining) [2021-12-22 16:22:38,571 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATION (20 of 105 remaining) [2021-12-22 16:22:38,571 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATION (19 of 105 remaining) [2021-12-22 16:22:38,571 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATION (18 of 105 remaining) [2021-12-22 16:22:38,571 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION (17 of 105 remaining) [2021-12-22 16:22:38,571 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATION (16 of 105 remaining) [2021-12-22 16:22:38,571 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATION (15 of 105 remaining) [2021-12-22 16:22:38,571 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATION (14 of 105 remaining) [2021-12-22 16:22:38,571 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATION (13 of 105 remaining) [2021-12-22 16:22:38,572 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATION (12 of 105 remaining) [2021-12-22 16:22:38,572 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATION (11 of 105 remaining) [2021-12-22 16:22:38,572 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATION (10 of 105 remaining) [2021-12-22 16:22:38,572 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATION (9 of 105 remaining) [2021-12-22 16:22:38,572 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_FREE (8 of 105 remaining) [2021-12-22 16:22:38,572 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE (7 of 105 remaining) [2021-12-22 16:22:38,572 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE (6 of 105 remaining) [2021-12-22 16:22:38,573 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84REQUIRES_VIOLATION (5 of 105 remaining) [2021-12-22 16:22:38,573 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATION (4 of 105 remaining) [2021-12-22 16:22:38,573 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONMEMORY_FREE (3 of 105 remaining) [2021-12-22 16:22:38,573 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONMEMORY_FREE (2 of 105 remaining) [2021-12-22 16:22:38,573 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONMEMORY_FREE (1 of 105 remaining) [2021-12-22 16:22:38,573 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK (0 of 105 remaining) [2021-12-22 16:22:38,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-22 16:22:38,576 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:38,581 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 16:22:38,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 04:22:38 BoogieIcfgContainer [2021-12-22 16:22:38,617 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 16:22:38,617 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 16:22:38,617 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 16:22:38,617 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 16:22:38,618 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:22:32" (3/4) ... [2021-12-22 16:22:38,619 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-22 16:22:38,658 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-22 16:22:38,658 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 16:22:38,659 INFO L158 Benchmark]: Toolchain (without parser) took 7375.86ms. Allocated memory was 100.7MB in the beginning and 188.7MB in the end (delta: 88.1MB). Free memory was 70.0MB in the beginning and 100.5MB in the end (delta: -30.5MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. [2021-12-22 16:22:38,659 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 16:22:38,659 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.75ms. Allocated memory is still 100.7MB. Free memory was 69.7MB in the beginning and 68.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-22 16:22:38,659 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.00ms. Allocated memory is still 100.7MB. Free memory was 68.0MB in the beginning and 65.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 16:22:38,660 INFO L158 Benchmark]: Boogie Preprocessor took 56.80ms. Allocated memory is still 100.7MB. Free memory was 65.1MB in the beginning and 62.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 16:22:38,660 INFO L158 Benchmark]: RCFGBuilder took 591.34ms. Allocated memory was 100.7MB in the beginning and 136.3MB in the end (delta: 35.7MB). Free memory was 62.4MB in the beginning and 93.1MB in the end (delta: -30.7MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2021-12-22 16:22:38,662 INFO L158 Benchmark]: TraceAbstraction took 6223.36ms. Allocated memory was 136.3MB in the beginning and 188.7MB in the end (delta: 52.4MB). Free memory was 92.5MB in the beginning and 103.7MB in the end (delta: -11.2MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2021-12-22 16:22:38,663 INFO L158 Benchmark]: Witness Printer took 41.23ms. Allocated memory is still 188.7MB. Free memory was 102.6MB in the beginning and 100.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 16:22:38,665 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.75ms. Allocated memory is still 100.7MB. Free memory was 69.7MB in the beginning and 68.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.00ms. Allocated memory is still 100.7MB. Free memory was 68.0MB in the beginning and 65.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.80ms. Allocated memory is still 100.7MB. Free memory was 65.1MB in the beginning and 62.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 591.34ms. Allocated memory was 100.7MB in the beginning and 136.3MB in the end (delta: 35.7MB). Free memory was 62.4MB in the beginning and 93.1MB in the end (delta: -30.7MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6223.36ms. Allocated memory was 136.3MB in the beginning and 188.7MB in the end (delta: 52.4MB). Free memory was 92.5MB in the beginning and 103.7MB in the end (delta: -11.2MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. * Witness Printer took 41.23ms. Allocated memory is still 188.7MB. Free memory was 102.6MB in the beginning and 100.5MB in the end (delta: 2.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 - CounterExampleResult [Line: 565]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L638] struct list *data = ((void *)0); VAL [data={0:0}] [L639] COND TRUE __VERIFIER_nondet_int() [L640] struct node *node = malloc(sizeof *node); [L641] COND FALSE !(!node) VAL [data={0:0}, node={-1:0}] [L643] node->next = node VAL [data={0:0}, node={-1:0}] [L644] node->value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-2, data={0:0}, node={-1:0}] [L645] struct list *item = malloc(sizeof *item); [L646] COND FALSE !(!item) VAL [data={0:0}, item={-3:0}, node={-1:0}] [L648] item->slist = node VAL [data={0:0}, item={-3:0}, node={-1:0}] [L649] item->next = data VAL [data={0:0}, item={-3:0}, node={-1:0}] [L650] data = item VAL [data={-3:0}, item={-3:0}, node={-1:0}] [L639] COND FALSE !(__VERIFIER_nondet_int()) [L652] COND FALSE !(!data) [L654] CALL inspect_before(data) [L615] COND FALSE !(!(shape)) VAL [shape={-3:0}, shape={-3:0}] [L616] shape->next VAL [shape={-3:0}, shape={-3:0}, shape->next={0:0}] [L616] COND FALSE !(shape->next) [L622] COND FALSE !(!(shape)) VAL [shape={-3:0}, shape={-3:0}] [L623] EXPR shape->next VAL [shape={-3:0}, shape={-3:0}, shape->next={0:0}] [L623] COND FALSE !(!(shape->next == ((void *)0))) [L624] EXPR shape->slist VAL [shape={-3:0}, shape={-3:0}, shape->slist={-1:0}] [L624] COND FALSE !(!(shape->slist)) [L625] EXPR shape->slist VAL [shape={-3:0}, shape={-3:0}, shape->slist={-1:0}] [L625] EXPR shape->slist->next VAL [shape={-3:0}, shape={-3:0}, shape->slist={-1:0}, shape->slist->next={-1:0}] [L625] COND TRUE !(shape->slist->next == ((void *)0)) [L625] CALL fail() [L565] reach_error() - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 649]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 649]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 624]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 624]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 630]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 630]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 631]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 631]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 661]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 661]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 636]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 262 locations, 105 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13149 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13131 mSDsluCounter, 12765 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8280 mSDsCounter, 263 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6284 IncrementalHoareTripleChecker+Invalid, 6547 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 263 mSolverCounterUnsat, 4485 mSDtfsCounter, 6284 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=291occurred in iteration=11, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 4281 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 390 NumberOfCodeBlocks, 390 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 338 ConstructedInterpolants, 0 QuantifiedInterpolants, 2232 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 24/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-22 16:22:38,730 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)