./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_13.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_13.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 00:02:20,103 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 00:02:20,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 00:02:20,139 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 00:02:20,140 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 00:02:20,142 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 00:02:20,143 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 00:02:20,145 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 00:02:20,147 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 00:02:20,150 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 00:02:20,150 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 00:02:20,151 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 00:02:20,152 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 00:02:20,153 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 00:02:20,154 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 00:02:20,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 00:02:20,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 00:02:20,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 00:02:20,160 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 00:02:20,164 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 00:02:20,165 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 00:02:20,166 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 00:02:20,167 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 00:02:20,167 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 00:02:20,172 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 00:02:20,172 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 00:02:20,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 00:02:20,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 00:02:20,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 00:02:20,174 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 00:02:20,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 00:02:20,175 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 00:02:20,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 00:02:20,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 00:02:20,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 00:02:20,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 00:02:20,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 00:02:20,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 00:02:20,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 00:02:20,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 00:02:20,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 00:02:20,181 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-21 00:02:20,205 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 00:02:20,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 00:02:20,205 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 00:02:20,205 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 00:02:20,206 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 00:02:20,206 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 00:02:20,207 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 00:02:20,207 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 00:02:20,207 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 00:02:20,207 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 00:02:20,208 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 00:02:20,208 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 00:02:20,208 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 00:02:20,208 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 00:02:20,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 00:02:20,209 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-21 00:02:20,209 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-21 00:02:20,209 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-21 00:02:20,209 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 00:02:20,209 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-21 00:02:20,209 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 00:02:20,210 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 00:02:20,210 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 00:02:20,210 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 00:02:20,210 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 00:02:20,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:20,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 00:02:20,211 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 00:02:20,212 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 00:02:20,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 00:02:20,212 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd [2022-02-21 00:02:20,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 00:02:20,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 00:02:20,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 00:02:20,472 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 00:02:20,473 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 00:02:20,474 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_13.c [2022-02-21 00:02:20,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a604e792/87e33f9511004affa93c6e933228872b/FLAG29a737c7e [2022-02-21 00:02:20,899 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 00:02:20,900 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c [2022-02-21 00:02:20,915 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a604e792/87e33f9511004affa93c6e933228872b/FLAG29a737c7e [2022-02-21 00:02:21,327 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a604e792/87e33f9511004affa93c6e933228872b [2022-02-21 00:02:21,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 00:02:21,331 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 00:02:21,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:21,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 00:02:21,336 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 00:02:21,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:21" (1/1) ... [2022-02-21 00:02:21,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f88676b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:21, skipping insertion in model container [2022-02-21 00:02:21,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:21" (1/1) ... [2022-02-21 00:02:21,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 00:02:21,367 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 00:02:21,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c[4936,4949] [2022-02-21 00:02:21,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:21,545 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 00:02:21,575 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c[4936,4949] [2022-02-21 00:02:21,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:21,588 INFO L208 MainTranslator]: Completed translation [2022-02-21 00:02:21,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:21 WrapperNode [2022-02-21 00:02:21,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:21,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:21,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 00:02:21,590 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 00:02:21,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:21" (1/1) ... [2022-02-21 00:02:21,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:21" (1/1) ... [2022-02-21 00:02:21,620 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 171 [2022-02-21 00:02:21,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:21,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 00:02:21,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 00:02:21,623 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 00:02:21,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:21" (1/1) ... [2022-02-21 00:02:21,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:21" (1/1) ... [2022-02-21 00:02:21,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:21" (1/1) ... [2022-02-21 00:02:21,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:21" (1/1) ... [2022-02-21 00:02:21,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:21" (1/1) ... [2022-02-21 00:02:21,639 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:21" (1/1) ... [2022-02-21 00:02:21,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:21" (1/1) ... [2022-02-21 00:02:21,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 00:02:21,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 00:02:21,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 00:02:21,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 00:02:21,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:21" (1/1) ... [2022-02-21 00:02:21,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:21,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:21,678 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 00:02:21,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 00:02:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 00:02:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 00:02:21,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 00:02:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 00:02:21,758 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 00:02:21,759 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 00:02:22,007 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 00:02:22,012 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 00:02:22,012 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 00:02:22,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:22 BoogieIcfgContainer [2022-02-21 00:02:22,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 00:02:22,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 00:02:22,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 00:02:22,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 00:02:22,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 12:02:21" (1/3) ... [2022-02-21 00:02:22,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70dde500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:22, skipping insertion in model container [2022-02-21 00:02:22,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:21" (2/3) ... [2022-02-21 00:02:22,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70dde500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:22, skipping insertion in model container [2022-02-21 00:02:22,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:22" (3/3) ... [2022-02-21 00:02:22,028 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2022-02-21 00:02:22,032 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 00:02:22,034 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-21 00:02:22,077 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 00:02:22,083 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 [2022-02-21 00:02:22,083 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-21 00:02:22,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 49 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 00:02:22,117 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:22,118 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 00:02:22,118 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:22,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:22,122 INFO L85 PathProgramCache]: Analyzing trace with hash 28705099, now seen corresponding path program 1 times [2022-02-21 00:02:22,129 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:22,129 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497730531] [2022-02-21 00:02:22,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:22,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:22,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {53#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {53#true} is VALID [2022-02-21 00:02:22,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {53#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; {53#true} is VALID [2022-02-21 00:02:22,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {53#true} assume false; {54#false} is VALID [2022-02-21 00:02:22,311 INFO L290 TraceCheckUtils]: 3: Hoare triple {54#false} main_#res#1 := 0; {54#false} is VALID [2022-02-21 00:02:22,311 INFO L290 TraceCheckUtils]: 4: Hoare triple {54#false} assume !(#valid == main_old_#valid#1); {54#false} is VALID [2022-02-21 00:02:22,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:22,313 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:22,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497730531] [2022-02-21 00:02:22,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497730531] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:22,314 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:22,314 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:22,316 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714738831] [2022-02-21 00:02:22,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:22,320 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 00:02:22,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:22,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:22,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-21 00:02:22,333 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:22,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 00:02:22,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 00:02:22,355 INFO L87 Difference]: Start difference. First operand has 50 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 49 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:22,426 INFO L93 Difference]: Finished difference Result 50 states and 88 transitions. [2022-02-21 00:02:22,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 00:02:22,427 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 00:02:22,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:22,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 91 transitions. [2022-02-21 00:02:22,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 91 transitions. [2022-02-21 00:02:22,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 91 transitions. [2022-02-21 00:02:22,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:22,523 INFO L225 Difference]: With dead ends: 50 [2022-02-21 00:02:22,523 INFO L226 Difference]: Without dead ends: 48 [2022-02-21 00:02:22,524 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 [2022-02-21 00:02:22,527 INFO L933 BasicCegarLoop]: 88 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, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:22,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:22,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-21 00:02:22,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-02-21 00:02:22,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:22,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 47 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,549 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 47 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,550 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 47 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:22,553 INFO L93 Difference]: Finished difference Result 48 states and 86 transitions. [2022-02-21 00:02:22,553 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 86 transitions. [2022-02-21 00:02:22,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:22,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:22,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 47 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 48 states. [2022-02-21 00:02:22,554 INFO L87 Difference]: Start difference. First operand has 48 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 47 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 48 states. [2022-02-21 00:02:22,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:22,557 INFO L93 Difference]: Finished difference Result 48 states and 86 transitions. [2022-02-21 00:02:22,557 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 86 transitions. [2022-02-21 00:02:22,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:22,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:22,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:22,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:22,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 47 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 86 transitions. [2022-02-21 00:02:22,561 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 86 transitions. Word has length 5 [2022-02-21 00:02:22,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:22,561 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 86 transitions. [2022-02-21 00:02:22,562 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) [2022-02-21 00:02:22,562 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 86 transitions. [2022-02-21 00:02:22,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 00:02:22,562 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:22,563 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 00:02:22,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 00:02:22,563 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:22,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:22,564 INFO L85 PathProgramCache]: Analyzing trace with hash 889699595, now seen corresponding path program 1 times [2022-02-21 00:02:22,565 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:22,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033895541] [2022-02-21 00:02:22,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:22,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:22,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {251#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {251#true} is VALID [2022-02-21 00:02:22,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; {253#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:22,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {253#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !false;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {253#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:22,656 INFO L290 TraceCheckUtils]: 3: Hoare triple {253#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume 0 == main_~cond~0#1; {253#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:22,657 INFO L290 TraceCheckUtils]: 4: Hoare triple {253#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} main_#res#1 := 0; {253#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:22,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {253#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {252#false} is VALID [2022-02-21 00:02:22,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:22,658 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:22,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033895541] [2022-02-21 00:02:22,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033895541] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:22,659 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:22,659 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:22,661 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698985239] [2022-02-21 00:02:22,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:22,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 00:02:22,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:22,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:22,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:22,669 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:22,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:22,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:22,670 INFO L87 Difference]: Start difference. First operand 48 states and 86 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:22,722 INFO L93 Difference]: Finished difference Result 47 states and 85 transitions. [2022-02-21 00:02:22,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:22,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 00:02:22,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:22,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2022-02-21 00:02:22,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2022-02-21 00:02:22,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 86 transitions. [2022-02-21 00:02:22,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:22,776 INFO L225 Difference]: With dead ends: 47 [2022-02-21 00:02:22,777 INFO L226 Difference]: Without dead ends: 45 [2022-02-21 00:02:22,777 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 [2022-02-21 00:02:22,778 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 80 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:22,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 85 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:22,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-21 00:02:22,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-02-21 00:02:22,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:22,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 44 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,781 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 44 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,782 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 44 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:22,784 INFO L93 Difference]: Finished difference Result 45 states and 83 transitions. [2022-02-21 00:02:22,784 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 83 transitions. [2022-02-21 00:02:22,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:22,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:22,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 44 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 45 states. [2022-02-21 00:02:22,785 INFO L87 Difference]: Start difference. First operand has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 44 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 45 states. [2022-02-21 00:02:22,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:22,787 INFO L93 Difference]: Finished difference Result 45 states and 83 transitions. [2022-02-21 00:02:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 83 transitions. [2022-02-21 00:02:22,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:22,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:22,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:22,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:22,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 44 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 83 transitions. [2022-02-21 00:02:22,790 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 83 transitions. Word has length 6 [2022-02-21 00:02:22,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:22,790 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 83 transitions. [2022-02-21 00:02:22,790 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) [2022-02-21 00:02:22,790 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 83 transitions. [2022-02-21 00:02:22,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-21 00:02:22,791 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:22,791 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:22,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 00:02:22,792 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:22,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:22,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1359894467, now seen corresponding path program 1 times [2022-02-21 00:02:22,792 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:22,793 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32877634] [2022-02-21 00:02:22,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:22,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:22,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {438#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {438#true} is VALID [2022-02-21 00:02:22,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {438#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; {438#true} is VALID [2022-02-21 00:02:22,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {438#true} assume !false;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {438#true} is VALID [2022-02-21 00:02:22,840 INFO L290 TraceCheckUtils]: 3: Hoare triple {438#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {438#true} is VALID [2022-02-21 00:02:22,840 INFO L290 TraceCheckUtils]: 4: Hoare triple {438#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:22,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:22,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume !(0 != main_~p3~0#1); {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:22,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:22,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:22,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:22,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:22,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:22,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:22,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:22,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume !(0 != main_~p11~0#1); {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:22,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:22,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:22,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p1~0#1; {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:22,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {440#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 1 != main_~lk1~0#1; {439#false} is VALID [2022-02-21 00:02:22,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {439#false} assume !false; {439#false} is VALID [2022-02-21 00:02:22,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:22,846 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:22,846 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32877634] [2022-02-21 00:02:22,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32877634] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:22,846 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:22,847 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:22,847 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176795331] [2022-02-21 00:02:22,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:22,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-21 00:02:22,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:22,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:22,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:22,861 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:22,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:22,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:22,862 INFO L87 Difference]: Start difference. First operand 45 states and 83 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:22,938 INFO L93 Difference]: Finished difference Result 87 states and 161 transitions. [2022-02-21 00:02:22,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:22,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-21 00:02:22,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:22,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2022-02-21 00:02:22,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2022-02-21 00:02:22,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 162 transitions. [2022-02-21 00:02:23,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:23,047 INFO L225 Difference]: With dead ends: 87 [2022-02-21 00:02:23,047 INFO L226 Difference]: Without dead ends: 87 [2022-02-21 00:02:23,048 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 [2022-02-21 00:02:23,049 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 63 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:23,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:23,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-02-21 00:02:23,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 59. [2022-02-21 00:02:23,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:23,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 59 states, 58 states have (on average 1.896551724137931) internal successors, (110), 58 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,054 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 59 states, 58 states have (on average 1.896551724137931) internal successors, (110), 58 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,054 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 59 states, 58 states have (on average 1.896551724137931) internal successors, (110), 58 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:23,058 INFO L93 Difference]: Finished difference Result 87 states and 161 transitions. [2022-02-21 00:02:23,058 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 161 transitions. [2022-02-21 00:02:23,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:23,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:23,059 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 58 states have (on average 1.896551724137931) internal successors, (110), 58 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 87 states. [2022-02-21 00:02:23,059 INFO L87 Difference]: Start difference. First operand has 59 states, 58 states have (on average 1.896551724137931) internal successors, (110), 58 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 87 states. [2022-02-21 00:02:23,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:23,062 INFO L93 Difference]: Finished difference Result 87 states and 161 transitions. [2022-02-21 00:02:23,062 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 161 transitions. [2022-02-21 00:02:23,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:23,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:23,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:23,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:23,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.896551724137931) internal successors, (110), 58 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 110 transitions. [2022-02-21 00:02:23,066 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 110 transitions. Word has length 20 [2022-02-21 00:02:23,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:23,070 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 110 transitions. [2022-02-21 00:02:23,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,070 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 110 transitions. [2022-02-21 00:02:23,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-21 00:02:23,071 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:23,071 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:23,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 00:02:23,073 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:23,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:23,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1914004475, now seen corresponding path program 1 times [2022-02-21 00:02:23,073 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:23,074 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912469117] [2022-02-21 00:02:23,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:23,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:23,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {763#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {763#true} is VALID [2022-02-21 00:02:23,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {763#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; {763#true} is VALID [2022-02-21 00:02:23,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {763#true} assume !false;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {763#true} is VALID [2022-02-21 00:02:23,120 INFO L290 TraceCheckUtils]: 3: Hoare triple {763#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {763#true} is VALID [2022-02-21 00:02:23,120 INFO L290 TraceCheckUtils]: 4: Hoare triple {763#true} assume !(0 != main_~p1~0#1); {765#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:23,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {765#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {765#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:23,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {765#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume !(0 != main_~p3~0#1); {765#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:23,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {765#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {765#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:23,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {765#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {765#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:23,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {765#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {765#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:23,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {765#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {765#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:23,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {765#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {765#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:23,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {765#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {765#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:23,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {765#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {765#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:23,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {765#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume !(0 != main_~p11~0#1); {765#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:23,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {765#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {765#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:23,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {765#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {765#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:23,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {765#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p1~0#1; {764#false} is VALID [2022-02-21 00:02:23,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {764#false} assume 1 != main_~lk1~0#1; {764#false} is VALID [2022-02-21 00:02:23,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {764#false} assume !false; {764#false} is VALID [2022-02-21 00:02:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:23,126 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:23,126 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912469117] [2022-02-21 00:02:23,126 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912469117] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:23,126 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:23,126 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:23,127 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744626708] [2022-02-21 00:02:23,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:23,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-21 00:02:23,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:23,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:23,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:23,141 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:23,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:23,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:23,142 INFO L87 Difference]: Start difference. First operand 59 states and 110 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:23,282 INFO L93 Difference]: Finished difference Result 87 states and 159 transitions. [2022-02-21 00:02:23,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:23,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-21 00:02:23,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:23,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2022-02-21 00:02:23,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2022-02-21 00:02:23,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 161 transitions. [2022-02-21 00:02:23,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:23,404 INFO L225 Difference]: With dead ends: 87 [2022-02-21 00:02:23,404 INFO L226 Difference]: Without dead ends: 87 [2022-02-21 00:02:23,405 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 [2022-02-21 00:02:23,408 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 63 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:23,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 185 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:23,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-02-21 00:02:23,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2022-02-21 00:02:23,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:23,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 85 states, 84 states have (on average 1.880952380952381) internal successors, (158), 84 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,417 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 85 states, 84 states have (on average 1.880952380952381) internal successors, (158), 84 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,417 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 85 states, 84 states have (on average 1.880952380952381) internal successors, (158), 84 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:23,419 INFO L93 Difference]: Finished difference Result 87 states and 159 transitions. [2022-02-21 00:02:23,419 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 159 transitions. [2022-02-21 00:02:23,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:23,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:23,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 84 states have (on average 1.880952380952381) internal successors, (158), 84 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 87 states. [2022-02-21 00:02:23,421 INFO L87 Difference]: Start difference. First operand has 85 states, 84 states have (on average 1.880952380952381) internal successors, (158), 84 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 87 states. [2022-02-21 00:02:23,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:23,423 INFO L93 Difference]: Finished difference Result 87 states and 159 transitions. [2022-02-21 00:02:23,423 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 159 transitions. [2022-02-21 00:02:23,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:23,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:23,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:23,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:23,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.880952380952381) internal successors, (158), 84 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 158 transitions. [2022-02-21 00:02:23,426 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 158 transitions. Word has length 20 [2022-02-21 00:02:23,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:23,427 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 158 transitions. [2022-02-21 00:02:23,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 158 transitions. [2022-02-21 00:02:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 00:02:23,428 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:23,428 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:23,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 00:02:23,428 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:23,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:23,429 INFO L85 PathProgramCache]: Analyzing trace with hash 793156859, now seen corresponding path program 1 times [2022-02-21 00:02:23,429 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:23,429 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281245704] [2022-02-21 00:02:23,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:23,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:23,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {1114#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1114#true} is VALID [2022-02-21 00:02:23,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {1114#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; {1114#true} is VALID [2022-02-21 00:02:23,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {1114#true} assume !false;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {1114#true} is VALID [2022-02-21 00:02:23,469 INFO L290 TraceCheckUtils]: 3: Hoare triple {1114#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {1114#true} is VALID [2022-02-21 00:02:23,469 INFO L290 TraceCheckUtils]: 4: Hoare triple {1114#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {1116#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:23,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {1116#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:23,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {1116#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p3~0#1); {1116#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:23,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1116#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:23,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1116#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:23,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1116#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:23,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {1116#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1116#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:23,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1116#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:23,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {1116#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {1116#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:23,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {1116#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {1116#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:23,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {1116#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p11~0#1); {1116#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:23,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {1116#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:23,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {1116#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:23,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p1~0#1); {1115#false} is VALID [2022-02-21 00:02:23,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {1115#false} assume 0 != main_~p2~0#1; {1115#false} is VALID [2022-02-21 00:02:23,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {1115#false} assume 1 != main_~lk2~0#1; {1115#false} is VALID [2022-02-21 00:02:23,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2022-02-21 00:02:23,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:23,475 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:23,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281245704] [2022-02-21 00:02:23,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281245704] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:23,475 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:23,475 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:23,475 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50228542] [2022-02-21 00:02:23,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:23,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-21 00:02:23,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:23,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:23,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:23,489 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:23,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:23,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:23,490 INFO L87 Difference]: Start difference. First operand 85 states and 158 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:23,578 INFO L93 Difference]: Finished difference Result 90 states and 161 transitions. [2022-02-21 00:02:23,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:23,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-21 00:02:23,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:23,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2022-02-21 00:02:23,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2022-02-21 00:02:23,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 160 transitions. [2022-02-21 00:02:23,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:23,668 INFO L225 Difference]: With dead ends: 90 [2022-02-21 00:02:23,668 INFO L226 Difference]: Without dead ends: 90 [2022-02-21 00:02:23,669 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 [2022-02-21 00:02:23,672 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 65 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:23,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 208 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:23,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-02-21 00:02:23,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2022-02-21 00:02:23,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:23,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 88 states, 87 states have (on average 1.839080459770115) internal successors, (160), 87 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,687 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 88 states, 87 states have (on average 1.839080459770115) internal successors, (160), 87 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,687 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 88 states, 87 states have (on average 1.839080459770115) internal successors, (160), 87 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:23,690 INFO L93 Difference]: Finished difference Result 90 states and 161 transitions. [2022-02-21 00:02:23,690 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 161 transitions. [2022-02-21 00:02:23,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:23,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:23,691 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 87 states have (on average 1.839080459770115) internal successors, (160), 87 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 90 states. [2022-02-21 00:02:23,691 INFO L87 Difference]: Start difference. First operand has 88 states, 87 states have (on average 1.839080459770115) internal successors, (160), 87 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 90 states. [2022-02-21 00:02:23,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:23,696 INFO L93 Difference]: Finished difference Result 90 states and 161 transitions. [2022-02-21 00:02:23,696 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 161 transitions. [2022-02-21 00:02:23,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:23,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:23,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:23,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:23,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.839080459770115) internal successors, (160), 87 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 160 transitions. [2022-02-21 00:02:23,702 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 160 transitions. Word has length 21 [2022-02-21 00:02:23,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:23,702 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 160 transitions. [2022-02-21 00:02:23,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 160 transitions. [2022-02-21 00:02:23,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 00:02:23,704 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:23,704 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:23,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 00:02:23,704 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:23,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:23,705 INFO L85 PathProgramCache]: Analyzing trace with hash -795191043, now seen corresponding path program 1 times [2022-02-21 00:02:23,705 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:23,705 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312458470] [2022-02-21 00:02:23,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:23,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:23,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {1477#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1477#true} is VALID [2022-02-21 00:02:23,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {1477#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; {1477#true} is VALID [2022-02-21 00:02:23,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {1477#true} assume !false;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {1477#true} is VALID [2022-02-21 00:02:23,790 INFO L290 TraceCheckUtils]: 3: Hoare triple {1477#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {1477#true} is VALID [2022-02-21 00:02:23,790 INFO L290 TraceCheckUtils]: 4: Hoare triple {1477#true} assume !(0 != main_~p1~0#1); {1477#true} is VALID [2022-02-21 00:02:23,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {1477#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:23,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p3~0#1); {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:23,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:23,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:23,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:23,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:23,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:23,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:23,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:23,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p11~0#1); {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:23,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:23,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:23,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p1~0#1); {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:23,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p2~0#1; {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:23,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {1479#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 1 != main_~lk2~0#1; {1478#false} is VALID [2022-02-21 00:02:23,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {1478#false} assume !false; {1478#false} is VALID [2022-02-21 00:02:23,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:23,798 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:23,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312458470] [2022-02-21 00:02:23,799 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312458470] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:23,799 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:23,799 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:23,799 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234401704] [2022-02-21 00:02:23,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:23,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-21 00:02:23,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:23,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:23,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:23,813 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:23,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:23,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:23,816 INFO L87 Difference]: Start difference. First operand 88 states and 160 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:23,882 INFO L93 Difference]: Finished difference Result 167 states and 306 transitions. [2022-02-21 00:02:23,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:23,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-21 00:02:23,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:23,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2022-02-21 00:02:23,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2022-02-21 00:02:23,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 158 transitions. [2022-02-21 00:02:24,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:24,022 INFO L225 Difference]: With dead ends: 167 [2022-02-21 00:02:24,023 INFO L226 Difference]: Without dead ends: 167 [2022-02-21 00:02:24,023 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 [2022-02-21 00:02:24,023 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 60 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:24,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 161 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:24,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-02-21 00:02:24,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 117. [2022-02-21 00:02:24,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:24,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 117 states, 116 states have (on average 1.8362068965517242) internal successors, (213), 116 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,027 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 117 states, 116 states have (on average 1.8362068965517242) internal successors, (213), 116 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,028 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 117 states, 116 states have (on average 1.8362068965517242) internal successors, (213), 116 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:24,031 INFO L93 Difference]: Finished difference Result 167 states and 306 transitions. [2022-02-21 00:02:24,031 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 306 transitions. [2022-02-21 00:02:24,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:24,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:24,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 116 states have (on average 1.8362068965517242) internal successors, (213), 116 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 167 states. [2022-02-21 00:02:24,032 INFO L87 Difference]: Start difference. First operand has 117 states, 116 states have (on average 1.8362068965517242) internal successors, (213), 116 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 167 states. [2022-02-21 00:02:24,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:24,036 INFO L93 Difference]: Finished difference Result 167 states and 306 transitions. [2022-02-21 00:02:24,036 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 306 transitions. [2022-02-21 00:02:24,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:24,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:24,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:24,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:24,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.8362068965517242) internal successors, (213), 116 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 213 transitions. [2022-02-21 00:02:24,040 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 213 transitions. Word has length 21 [2022-02-21 00:02:24,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:24,040 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 213 transitions. [2022-02-21 00:02:24,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,040 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 213 transitions. [2022-02-21 00:02:24,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 00:02:24,041 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:24,041 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:24,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 00:02:24,041 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:24,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:24,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1816259397, now seen corresponding path program 1 times [2022-02-21 00:02:24,042 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:24,042 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595146653] [2022-02-21 00:02:24,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:24,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:24,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {2100#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2100#true} is VALID [2022-02-21 00:02:24,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {2100#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; {2100#true} is VALID [2022-02-21 00:02:24,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {2100#true} assume !false;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {2100#true} is VALID [2022-02-21 00:02:24,074 INFO L290 TraceCheckUtils]: 3: Hoare triple {2100#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {2100#true} is VALID [2022-02-21 00:02:24,074 INFO L290 TraceCheckUtils]: 4: Hoare triple {2100#true} assume !(0 != main_~p1~0#1); {2100#true} is VALID [2022-02-21 00:02:24,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {2100#true} assume !(0 != main_~p2~0#1); {2102#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:24,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {2102#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p3~0#1); {2102#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:24,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {2102#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {2102#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:24,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {2102#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2102#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:24,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {2102#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2102#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:24,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {2102#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {2102#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:24,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {2102#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {2102#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:24,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {2102#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {2102#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:24,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {2102#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {2102#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:24,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {2102#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p11~0#1); {2102#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:24,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {2102#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {2102#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:24,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {2102#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {2102#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:24,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {2102#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p1~0#1); {2102#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:24,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {2102#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p2~0#1; {2101#false} is VALID [2022-02-21 00:02:24,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {2101#false} assume 1 != main_~lk2~0#1; {2101#false} is VALID [2022-02-21 00:02:24,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {2101#false} assume !false; {2101#false} is VALID [2022-02-21 00:02:24,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:24,079 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:24,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595146653] [2022-02-21 00:02:24,080 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595146653] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:24,080 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:24,080 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:24,080 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947640244] [2022-02-21 00:02:24,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:24,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-21 00:02:24,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:24,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:24,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:24,092 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:24,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:24,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:24,093 INFO L87 Difference]: Start difference. First operand 117 states and 213 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:24,164 INFO L93 Difference]: Finished difference Result 169 states and 304 transitions. [2022-02-21 00:02:24,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:24,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-21 00:02:24,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:24,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2022-02-21 00:02:24,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2022-02-21 00:02:24,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 159 transitions. [2022-02-21 00:02:24,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:24,253 INFO L225 Difference]: With dead ends: 169 [2022-02-21 00:02:24,254 INFO L226 Difference]: Without dead ends: 169 [2022-02-21 00:02:24,254 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 [2022-02-21 00:02:24,254 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 62 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:24,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 186 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:24,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-02-21 00:02:24,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2022-02-21 00:02:24,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:24,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 167 states, 166 states have (on average 1.8253012048192772) internal successors, (303), 166 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,258 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 167 states, 166 states have (on average 1.8253012048192772) internal successors, (303), 166 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,259 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 167 states, 166 states have (on average 1.8253012048192772) internal successors, (303), 166 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:24,262 INFO L93 Difference]: Finished difference Result 169 states and 304 transitions. [2022-02-21 00:02:24,263 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 304 transitions. [2022-02-21 00:02:24,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:24,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:24,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 166 states have (on average 1.8253012048192772) internal successors, (303), 166 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 169 states. [2022-02-21 00:02:24,264 INFO L87 Difference]: Start difference. First operand has 167 states, 166 states have (on average 1.8253012048192772) internal successors, (303), 166 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 169 states. [2022-02-21 00:02:24,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:24,267 INFO L93 Difference]: Finished difference Result 169 states and 304 transitions. [2022-02-21 00:02:24,268 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 304 transitions. [2022-02-21 00:02:24,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:24,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:24,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:24,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:24,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.8253012048192772) internal successors, (303), 166 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 303 transitions. [2022-02-21 00:02:24,272 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 303 transitions. Word has length 21 [2022-02-21 00:02:24,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:24,272 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 303 transitions. [2022-02-21 00:02:24,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,272 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 303 transitions. [2022-02-21 00:02:24,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-21 00:02:24,273 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:24,273 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:24,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-21 00:02:24,273 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:24,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:24,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1119094160, now seen corresponding path program 1 times [2022-02-21 00:02:24,274 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:24,274 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385022372] [2022-02-21 00:02:24,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:24,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:24,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {2779#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2779#true} is VALID [2022-02-21 00:02:24,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {2779#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; {2779#true} is VALID [2022-02-21 00:02:24,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {2779#true} assume !false;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {2779#true} is VALID [2022-02-21 00:02:24,305 INFO L290 TraceCheckUtils]: 3: Hoare triple {2779#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {2779#true} is VALID [2022-02-21 00:02:24,306 INFO L290 TraceCheckUtils]: 4: Hoare triple {2779#true} assume !(0 != main_~p1~0#1); {2779#true} is VALID [2022-02-21 00:02:24,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {2779#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {2781#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:24,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {2781#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p3~0#1); {2781#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:24,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {2781#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {2781#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:24,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {2781#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2781#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:24,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {2781#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2781#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:24,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {2781#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {2781#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:24,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {2781#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {2781#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:24,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {2781#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {2781#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:24,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {2781#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {2781#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:24,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {2781#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p11~0#1); {2781#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:24,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {2781#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {2781#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:24,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {2781#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {2781#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:24,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {2781#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p1~0#1); {2781#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:24,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {2781#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p2~0#1); {2780#false} is VALID [2022-02-21 00:02:24,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {2780#false} assume 0 != main_~p3~0#1; {2780#false} is VALID [2022-02-21 00:02:24,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {2780#false} assume 1 != main_~lk3~0#1; {2780#false} is VALID [2022-02-21 00:02:24,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {2780#false} assume !false; {2780#false} is VALID [2022-02-21 00:02:24,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:24,311 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:24,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385022372] [2022-02-21 00:02:24,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385022372] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:24,311 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:24,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:24,312 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123998568] [2022-02-21 00:02:24,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:24,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-21 00:02:24,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:24,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:24,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:24,325 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:24,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:24,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:24,325 INFO L87 Difference]: Start difference. First operand 167 states and 303 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:24,410 INFO L93 Difference]: Finished difference Result 171 states and 304 transitions. [2022-02-21 00:02:24,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:24,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-21 00:02:24,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:24,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2022-02-21 00:02:24,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2022-02-21 00:02:24,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 158 transitions. [2022-02-21 00:02:24,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:24,496 INFO L225 Difference]: With dead ends: 171 [2022-02-21 00:02:24,496 INFO L226 Difference]: Without dead ends: 171 [2022-02-21 00:02:24,496 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 [2022-02-21 00:02:24,497 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 64 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:24,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 204 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:24,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-02-21 00:02:24,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2022-02-21 00:02:24,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:24,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 169 states, 168 states have (on average 1.8035714285714286) internal successors, (303), 168 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,507 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 169 states, 168 states have (on average 1.8035714285714286) internal successors, (303), 168 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,507 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 169 states, 168 states have (on average 1.8035714285714286) internal successors, (303), 168 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:24,510 INFO L93 Difference]: Finished difference Result 171 states and 304 transitions. [2022-02-21 00:02:24,510 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 304 transitions. [2022-02-21 00:02:24,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:24,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:24,510 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 168 states have (on average 1.8035714285714286) internal successors, (303), 168 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 171 states. [2022-02-21 00:02:24,511 INFO L87 Difference]: Start difference. First operand has 169 states, 168 states have (on average 1.8035714285714286) internal successors, (303), 168 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 171 states. [2022-02-21 00:02:24,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:24,513 INFO L93 Difference]: Finished difference Result 171 states and 304 transitions. [2022-02-21 00:02:24,513 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 304 transitions. [2022-02-21 00:02:24,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:24,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:24,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:24,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:24,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.8035714285714286) internal successors, (303), 168 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 303 transitions. [2022-02-21 00:02:24,516 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 303 transitions. Word has length 22 [2022-02-21 00:02:24,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:24,517 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 303 transitions. [2022-02-21 00:02:24,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,517 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 303 transitions. [2022-02-21 00:02:24,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-21 00:02:24,517 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:24,518 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:24,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-21 00:02:24,518 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:24,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:24,518 INFO L85 PathProgramCache]: Analyzing trace with hash -469253742, now seen corresponding path program 1 times [2022-02-21 00:02:24,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:24,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61558413] [2022-02-21 00:02:24,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:24,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:24,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {3466#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3466#true} is VALID [2022-02-21 00:02:24,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {3466#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; {3466#true} is VALID [2022-02-21 00:02:24,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {3466#true} assume !false;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {3466#true} is VALID [2022-02-21 00:02:24,579 INFO L290 TraceCheckUtils]: 3: Hoare triple {3466#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {3466#true} is VALID [2022-02-21 00:02:24,579 INFO L290 TraceCheckUtils]: 4: Hoare triple {3466#true} assume !(0 != main_~p1~0#1); {3466#true} is VALID [2022-02-21 00:02:24,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {3466#true} assume !(0 != main_~p2~0#1); {3466#true} is VALID [2022-02-21 00:02:24,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {3466#true} assume !(0 != main_~p3~0#1); {3468#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:24,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {3468#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {3468#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:24,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {3468#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {3468#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:24,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {3468#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {3468#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:24,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {3468#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {3468#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:24,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {3468#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {3468#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:24,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {3468#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {3468#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:24,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {3468#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {3468#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:24,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {3468#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p11~0#1); {3468#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:24,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {3468#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {3468#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:24,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {3468#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {3468#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:24,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {3468#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p1~0#1); {3468#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:24,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {3468#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p2~0#1); {3468#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:24,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {3468#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p3~0#1; {3467#false} is VALID [2022-02-21 00:02:24,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {3467#false} assume 1 != main_~lk3~0#1; {3467#false} is VALID [2022-02-21 00:02:24,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {3467#false} assume !false; {3467#false} is VALID [2022-02-21 00:02:24,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:24,583 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:24,583 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61558413] [2022-02-21 00:02:24,584 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61558413] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:24,584 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:24,584 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:24,584 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51015387] [2022-02-21 00:02:24,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:24,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-21 00:02:24,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:24,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:24,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:24,595 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:24,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:24,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:24,596 INFO L87 Difference]: Start difference. First operand 169 states and 303 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:24,683 INFO L93 Difference]: Finished difference Result 327 states and 580 transitions. [2022-02-21 00:02:24,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:24,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-21 00:02:24,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:24,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2022-02-21 00:02:24,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2022-02-21 00:02:24,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 158 transitions. [2022-02-21 00:02:24,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:24,777 INFO L225 Difference]: With dead ends: 327 [2022-02-21 00:02:24,777 INFO L226 Difference]: Without dead ends: 327 [2022-02-21 00:02:24,777 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 [2022-02-21 00:02:24,778 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 62 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:24,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 163 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:24,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-02-21 00:02:24,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2022-02-21 00:02:24,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:24,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 327 states. Second operand has 325 states, 324 states have (on average 1.787037037037037) internal successors, (579), 324 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,782 INFO L74 IsIncluded]: Start isIncluded. First operand 327 states. Second operand has 325 states, 324 states have (on average 1.787037037037037) internal successors, (579), 324 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,782 INFO L87 Difference]: Start difference. First operand 327 states. Second operand has 325 states, 324 states have (on average 1.787037037037037) internal successors, (579), 324 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:24,787 INFO L93 Difference]: Finished difference Result 327 states and 580 transitions. [2022-02-21 00:02:24,788 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 580 transitions. [2022-02-21 00:02:24,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:24,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:24,788 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 324 states have (on average 1.787037037037037) internal successors, (579), 324 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 327 states. [2022-02-21 00:02:24,789 INFO L87 Difference]: Start difference. First operand has 325 states, 324 states have (on average 1.787037037037037) internal successors, (579), 324 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 327 states. [2022-02-21 00:02:24,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:24,794 INFO L93 Difference]: Finished difference Result 327 states and 580 transitions. [2022-02-21 00:02:24,794 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 580 transitions. [2022-02-21 00:02:24,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:24,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:24,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:24,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:24,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.787037037037037) internal successors, (579), 324 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 579 transitions. [2022-02-21 00:02:24,801 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 579 transitions. Word has length 22 [2022-02-21 00:02:24,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:24,801 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 579 transitions. [2022-02-21 00:02:24,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,801 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 579 transitions. [2022-02-21 00:02:24,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-21 00:02:24,801 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:24,802 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:24,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-21 00:02:24,802 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:24,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:24,802 INFO L85 PathProgramCache]: Analyzing trace with hash 551814612, now seen corresponding path program 1 times [2022-02-21 00:02:24,802 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:24,802 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920259686] [2022-02-21 00:02:24,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:24,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:24,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {4777#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {4777#true} is VALID [2022-02-21 00:02:24,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {4777#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; {4777#true} is VALID [2022-02-21 00:02:24,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {4777#true} assume !false;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {4777#true} is VALID [2022-02-21 00:02:24,827 INFO L290 TraceCheckUtils]: 3: Hoare triple {4777#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {4777#true} is VALID [2022-02-21 00:02:24,827 INFO L290 TraceCheckUtils]: 4: Hoare triple {4777#true} assume !(0 != main_~p1~0#1); {4777#true} is VALID [2022-02-21 00:02:24,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {4777#true} assume !(0 != main_~p2~0#1); {4777#true} is VALID [2022-02-21 00:02:24,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {4777#true} assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:24,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:24,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:24,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:24,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:24,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:24,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:24,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:24,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p11~0#1); {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:24,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:24,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:24,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p1~0#1); {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:24,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p2~0#1); {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:24,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p3~0#1; {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:24,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {4779#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 1 != main_~lk3~0#1; {4778#false} is VALID [2022-02-21 00:02:24,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {4778#false} assume !false; {4778#false} is VALID [2022-02-21 00:02:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:24,831 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:24,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920259686] [2022-02-21 00:02:24,831 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920259686] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:24,831 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:24,831 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:24,832 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092108813] [2022-02-21 00:02:24,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:24,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-21 00:02:24,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:24,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:24,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:24,843 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:24,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:24,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:24,844 INFO L87 Difference]: Start difference. First operand 325 states and 579 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:24,922 INFO L93 Difference]: Finished difference Result 415 states and 744 transitions. [2022-02-21 00:02:24,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:24,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-21 00:02:24,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2022-02-21 00:02:24,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2022-02-21 00:02:24,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 151 transitions. [2022-02-21 00:02:25,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:25,010 INFO L225 Difference]: With dead ends: 415 [2022-02-21 00:02:25,010 INFO L226 Difference]: Without dead ends: 415 [2022-02-21 00:02:25,010 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 [2022-02-21 00:02:25,010 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 57 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:25,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 224 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:25,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-02-21 00:02:25,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 325. [2022-02-21 00:02:25,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:25,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 415 states. Second operand has 325 states, 324 states have (on average 1.7746913580246915) internal successors, (575), 324 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,015 INFO L74 IsIncluded]: Start isIncluded. First operand 415 states. Second operand has 325 states, 324 states have (on average 1.7746913580246915) internal successors, (575), 324 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,015 INFO L87 Difference]: Start difference. First operand 415 states. Second operand has 325 states, 324 states have (on average 1.7746913580246915) internal successors, (575), 324 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,023 INFO L93 Difference]: Finished difference Result 415 states and 744 transitions. [2022-02-21 00:02:25,023 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 744 transitions. [2022-02-21 00:02:25,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:25,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:25,024 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 324 states have (on average 1.7746913580246915) internal successors, (575), 324 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 415 states. [2022-02-21 00:02:25,024 INFO L87 Difference]: Start difference. First operand has 325 states, 324 states have (on average 1.7746913580246915) internal successors, (575), 324 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 415 states. [2022-02-21 00:02:25,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,032 INFO L93 Difference]: Finished difference Result 415 states and 744 transitions. [2022-02-21 00:02:25,032 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 744 transitions. [2022-02-21 00:02:25,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:25,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:25,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:25,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:25,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.7746913580246915) internal successors, (575), 324 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 575 transitions. [2022-02-21 00:02:25,038 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 575 transitions. Word has length 22 [2022-02-21 00:02:25,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:25,038 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 575 transitions. [2022-02-21 00:02:25,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,038 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 575 transitions. [2022-02-21 00:02:25,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-21 00:02:25,052 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:25,052 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:25,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-21 00:02:25,052 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:25,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:25,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1661751056, now seen corresponding path program 1 times [2022-02-21 00:02:25,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:25,052 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383478877] [2022-02-21 00:02:25,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:25,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:25,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {6352#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {6352#true} is VALID [2022-02-21 00:02:25,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {6352#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; {6352#true} is VALID [2022-02-21 00:02:25,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {6352#true} assume !false;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {6352#true} is VALID [2022-02-21 00:02:25,078 INFO L290 TraceCheckUtils]: 3: Hoare triple {6352#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {6352#true} is VALID [2022-02-21 00:02:25,078 INFO L290 TraceCheckUtils]: 4: Hoare triple {6352#true} assume !(0 != main_~p1~0#1); {6352#true} is VALID [2022-02-21 00:02:25,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {6352#true} assume !(0 != main_~p2~0#1); {6352#true} is VALID [2022-02-21 00:02:25,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {6352#true} assume !(0 != main_~p3~0#1); {6352#true} is VALID [2022-02-21 00:02:25,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {6352#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:25,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:25,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:25,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:25,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:25,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:25,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:25,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p11~0#1); {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:25,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:25,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:25,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p1~0#1); {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:25,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p2~0#1); {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:25,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p3~0#1); {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:25,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p4~0#1; {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:25,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {6354#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 1 != main_~lk4~0#1; {6353#false} is VALID [2022-02-21 00:02:25,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {6353#false} assume !false; {6353#false} is VALID [2022-02-21 00:02:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:25,083 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:25,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383478877] [2022-02-21 00:02:25,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383478877] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:25,083 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:25,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:25,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404093755] [2022-02-21 00:02:25,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:25,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-21 00:02:25,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:25,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:25,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:25,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:25,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:25,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:25,097 INFO L87 Difference]: Start difference. First operand 325 states and 575 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,173 INFO L93 Difference]: Finished difference Result 611 states and 1088 transitions. [2022-02-21 00:02:25,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:25,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-21 00:02:25,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:25,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2022-02-21 00:02:25,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2022-02-21 00:02:25,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2022-02-21 00:02:25,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:25,263 INFO L225 Difference]: With dead ends: 611 [2022-02-21 00:02:25,263 INFO L226 Difference]: Without dead ends: 611 [2022-02-21 00:02:25,263 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 [2022-02-21 00:02:25,263 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 54 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:25,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 157 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:25,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-02-21 00:02:25,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 449. [2022-02-21 00:02:25,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:25,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 611 states. Second operand has 449 states, 448 states have (on average 1.7477678571428572) internal successors, (783), 448 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,269 INFO L74 IsIncluded]: Start isIncluded. First operand 611 states. Second operand has 449 states, 448 states have (on average 1.7477678571428572) internal successors, (783), 448 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,270 INFO L87 Difference]: Start difference. First operand 611 states. Second operand has 449 states, 448 states have (on average 1.7477678571428572) internal successors, (783), 448 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,282 INFO L93 Difference]: Finished difference Result 611 states and 1088 transitions. [2022-02-21 00:02:25,283 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1088 transitions. [2022-02-21 00:02:25,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:25,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:25,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 449 states, 448 states have (on average 1.7477678571428572) internal successors, (783), 448 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 611 states. [2022-02-21 00:02:25,284 INFO L87 Difference]: Start difference. First operand has 449 states, 448 states have (on average 1.7477678571428572) internal successors, (783), 448 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 611 states. [2022-02-21 00:02:25,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,298 INFO L93 Difference]: Finished difference Result 611 states and 1088 transitions. [2022-02-21 00:02:25,298 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1088 transitions. [2022-02-21 00:02:25,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:25,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:25,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:25,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.7477678571428572) internal successors, (783), 448 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 783 transitions. [2022-02-21 00:02:25,307 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 783 transitions. Word has length 23 [2022-02-21 00:02:25,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:25,307 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 783 transitions. [2022-02-21 00:02:25,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,307 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 783 transitions. [2022-02-21 00:02:25,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-21 00:02:25,308 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:25,308 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:25,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-21 00:02:25,308 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:25,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:25,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1612147886, now seen corresponding path program 1 times [2022-02-21 00:02:25,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:25,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677573550] [2022-02-21 00:02:25,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:25,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:25,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {8639#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {8639#true} is VALID [2022-02-21 00:02:25,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {8639#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; {8639#true} is VALID [2022-02-21 00:02:25,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {8639#true} assume !false;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {8639#true} is VALID [2022-02-21 00:02:25,330 INFO L290 TraceCheckUtils]: 3: Hoare triple {8639#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {8639#true} is VALID [2022-02-21 00:02:25,330 INFO L290 TraceCheckUtils]: 4: Hoare triple {8639#true} assume !(0 != main_~p1~0#1); {8639#true} is VALID [2022-02-21 00:02:25,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {8639#true} assume !(0 != main_~p2~0#1); {8639#true} is VALID [2022-02-21 00:02:25,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {8639#true} assume !(0 != main_~p3~0#1); {8639#true} is VALID [2022-02-21 00:02:25,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {8639#true} assume !(0 != main_~p4~0#1); {8641#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:25,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {8641#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {8641#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:25,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {8641#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {8641#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:25,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {8641#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {8641#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:25,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {8641#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {8641#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:25,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {8641#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {8641#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:25,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {8641#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {8641#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:25,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {8641#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p11~0#1); {8641#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:25,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {8641#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {8641#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:25,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {8641#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {8641#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:25,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {8641#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p1~0#1); {8641#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:25,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {8641#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p2~0#1); {8641#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:25,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {8641#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p3~0#1); {8641#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:25,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {8641#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p4~0#1; {8640#false} is VALID [2022-02-21 00:02:25,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {8640#false} assume 1 != main_~lk4~0#1; {8640#false} is VALID [2022-02-21 00:02:25,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {8640#false} assume !false; {8640#false} is VALID [2022-02-21 00:02:25,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:25,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:25,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677573550] [2022-02-21 00:02:25,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677573550] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:25,334 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:25,334 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:25,334 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103777647] [2022-02-21 00:02:25,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:25,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-21 00:02:25,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:25,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:25,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:25,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:25,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:25,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:25,348 INFO L87 Difference]: Start difference. First operand 449 states and 783 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,444 INFO L93 Difference]: Finished difference Result 635 states and 1100 transitions. [2022-02-21 00:02:25,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:25,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-21 00:02:25,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:25,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2022-02-21 00:02:25,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2022-02-21 00:02:25,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 155 transitions. [2022-02-21 00:02:25,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:25,552 INFO L225 Difference]: With dead ends: 635 [2022-02-21 00:02:25,553 INFO L226 Difference]: Without dead ends: 635 [2022-02-21 00:02:25,553 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 [2022-02-21 00:02:25,554 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 60 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:25,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 188 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:25,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2022-02-21 00:02:25,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2022-02-21 00:02:25,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:25,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 635 states. Second operand has 633 states, 632 states have (on average 1.7389240506329113) internal successors, (1099), 632 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,566 INFO L74 IsIncluded]: Start isIncluded. First operand 635 states. Second operand has 633 states, 632 states have (on average 1.7389240506329113) internal successors, (1099), 632 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,566 INFO L87 Difference]: Start difference. First operand 635 states. Second operand has 633 states, 632 states have (on average 1.7389240506329113) internal successors, (1099), 632 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,587 INFO L93 Difference]: Finished difference Result 635 states and 1100 transitions. [2022-02-21 00:02:25,587 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1100 transitions. [2022-02-21 00:02:25,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:25,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:25,589 INFO L74 IsIncluded]: Start isIncluded. First operand has 633 states, 632 states have (on average 1.7389240506329113) internal successors, (1099), 632 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 635 states. [2022-02-21 00:02:25,590 INFO L87 Difference]: Start difference. First operand has 633 states, 632 states have (on average 1.7389240506329113) internal successors, (1099), 632 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 635 states. [2022-02-21 00:02:25,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,607 INFO L93 Difference]: Finished difference Result 635 states and 1100 transitions. [2022-02-21 00:02:25,608 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1100 transitions. [2022-02-21 00:02:25,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:25,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:25,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:25,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 1.7389240506329113) internal successors, (1099), 632 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1099 transitions. [2022-02-21 00:02:25,624 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1099 transitions. Word has length 23 [2022-02-21 00:02:25,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:25,624 INFO L470 AbstractCegarLoop]: Abstraction has 633 states and 1099 transitions. [2022-02-21 00:02:25,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,624 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1099 transitions. [2022-02-21 00:02:25,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-21 00:02:25,625 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:25,625 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:25,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-21 00:02:25,625 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:25,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:25,626 INFO L85 PathProgramCache]: Analyzing trace with hash 25538215, now seen corresponding path program 1 times [2022-02-21 00:02:25,626 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:25,626 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415038848] [2022-02-21 00:02:25,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:25,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:25,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {11182#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {11182#true} is VALID [2022-02-21 00:02:25,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {11182#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; {11182#true} is VALID [2022-02-21 00:02:25,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {11182#true} assume !false;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {11182#true} is VALID [2022-02-21 00:02:25,662 INFO L290 TraceCheckUtils]: 3: Hoare triple {11182#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {11182#true} is VALID [2022-02-21 00:02:25,662 INFO L290 TraceCheckUtils]: 4: Hoare triple {11182#true} assume !(0 != main_~p1~0#1); {11182#true} is VALID [2022-02-21 00:02:25,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {11182#true} assume !(0 != main_~p2~0#1); {11182#true} is VALID [2022-02-21 00:02:25,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {11182#true} assume !(0 != main_~p3~0#1); {11182#true} is VALID [2022-02-21 00:02:25,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {11182#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {11184#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:25,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {11184#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {11184#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:25,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {11184#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {11184#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:25,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {11184#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {11184#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:25,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {11184#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {11184#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:25,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {11184#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {11184#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:25,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {11184#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {11184#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:25,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {11184#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p11~0#1); {11184#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:25,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {11184#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {11184#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:25,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {11184#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {11184#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:25,665 INFO L290 TraceCheckUtils]: 17: Hoare triple {11184#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p1~0#1); {11184#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:25,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {11184#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p2~0#1); {11184#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:25,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {11184#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p3~0#1); {11184#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:25,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {11184#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p4~0#1); {11183#false} is VALID [2022-02-21 00:02:25,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {11183#false} assume 0 != main_~p5~0#1; {11183#false} is VALID [2022-02-21 00:02:25,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {11183#false} assume 1 != main_~lk5~0#1; {11183#false} is VALID [2022-02-21 00:02:25,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {11183#false} assume !false; {11183#false} is VALID [2022-02-21 00:02:25,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:25,667 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:25,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415038848] [2022-02-21 00:02:25,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415038848] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:25,667 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:25,667 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:25,667 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876510703] [2022-02-21 00:02:25,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:25,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-21 00:02:25,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:25,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:25,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:25,696 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:25,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:25,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:25,696 INFO L87 Difference]: Start difference. First operand 633 states and 1099 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,777 INFO L93 Difference]: Finished difference Result 647 states and 1108 transitions. [2022-02-21 00:02:25,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:25,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-21 00:02:25,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:25,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2022-02-21 00:02:25,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2022-02-21 00:02:25,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 154 transitions. [2022-02-21 00:02:25,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:25,883 INFO L225 Difference]: With dead ends: 647 [2022-02-21 00:02:25,883 INFO L226 Difference]: Without dead ends: 647 [2022-02-21 00:02:25,883 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 [2022-02-21 00:02:25,884 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 62 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:25,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 196 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:25,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-02-21 00:02:25,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 645. [2022-02-21 00:02:25,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:25,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 647 states. Second operand has 645 states, 644 states have (on average 1.718944099378882) internal successors, (1107), 644 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,893 INFO L74 IsIncluded]: Start isIncluded. First operand 647 states. Second operand has 645 states, 644 states have (on average 1.718944099378882) internal successors, (1107), 644 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,894 INFO L87 Difference]: Start difference. First operand 647 states. Second operand has 645 states, 644 states have (on average 1.718944099378882) internal successors, (1107), 644 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,909 INFO L93 Difference]: Finished difference Result 647 states and 1108 transitions. [2022-02-21 00:02:25,909 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1108 transitions. [2022-02-21 00:02:25,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:25,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:25,911 INFO L74 IsIncluded]: Start isIncluded. First operand has 645 states, 644 states have (on average 1.718944099378882) internal successors, (1107), 644 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 647 states. [2022-02-21 00:02:25,912 INFO L87 Difference]: Start difference. First operand has 645 states, 644 states have (on average 1.718944099378882) internal successors, (1107), 644 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 647 states. [2022-02-21 00:02:25,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,927 INFO L93 Difference]: Finished difference Result 647 states and 1108 transitions. [2022-02-21 00:02:25,927 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1108 transitions. [2022-02-21 00:02:25,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:25,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:25,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:25,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:25,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.718944099378882) internal successors, (1107), 644 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1107 transitions. [2022-02-21 00:02:25,942 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1107 transitions. Word has length 24 [2022-02-21 00:02:25,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:25,942 INFO L470 AbstractCegarLoop]: Abstraction has 645 states and 1107 transitions. [2022-02-21 00:02:25,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,942 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1107 transitions. [2022-02-21 00:02:25,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-21 00:02:25,943 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:25,943 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:25,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-21 00:02:25,943 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:25,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:25,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1562809687, now seen corresponding path program 1 times [2022-02-21 00:02:25,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:25,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841544628] [2022-02-21 00:02:25,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:25,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:25,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {13773#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {13773#true} is VALID [2022-02-21 00:02:25,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {13773#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; {13773#true} is VALID [2022-02-21 00:02:25,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {13773#true} assume !false;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {13773#true} is VALID [2022-02-21 00:02:25,964 INFO L290 TraceCheckUtils]: 3: Hoare triple {13773#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {13773#true} is VALID [2022-02-21 00:02:25,964 INFO L290 TraceCheckUtils]: 4: Hoare triple {13773#true} assume !(0 != main_~p1~0#1); {13773#true} is VALID [2022-02-21 00:02:25,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {13773#true} assume !(0 != main_~p2~0#1); {13773#true} is VALID [2022-02-21 00:02:25,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {13773#true} assume !(0 != main_~p3~0#1); {13773#true} is VALID [2022-02-21 00:02:25,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {13773#true} assume !(0 != main_~p4~0#1); {13773#true} is VALID [2022-02-21 00:02:25,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {13773#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:25,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:25,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:25,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:25,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:25,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:25,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p11~0#1); {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:25,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:25,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:25,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p1~0#1); {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:25,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p2~0#1); {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:25,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p3~0#1); {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:25,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p4~0#1); {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:25,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p5~0#1; {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:25,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {13775#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 1 != main_~lk5~0#1; {13774#false} is VALID [2022-02-21 00:02:25,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {13774#false} assume !false; {13774#false} is VALID [2022-02-21 00:02:25,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:25,968 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:25,968 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841544628] [2022-02-21 00:02:25,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841544628] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:25,968 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:25,968 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:25,968 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223223498] [2022-02-21 00:02:25,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:25,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-21 00:02:25,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:25,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:25,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:25,980 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:25,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:25,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:25,981 INFO L87 Difference]: Start difference. First operand 645 states and 1107 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:26,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,073 INFO L93 Difference]: Finished difference Result 1191 states and 2060 transitions. [2022-02-21 00:02:26,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:26,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-21 00:02:26,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:26,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2022-02-21 00:02:26,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:26,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2022-02-21 00:02:26,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 146 transitions. [2022-02-21 00:02:26,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:26,187 INFO L225 Difference]: With dead ends: 1191 [2022-02-21 00:02:26,187 INFO L226 Difference]: Without dead ends: 1191 [2022-02-21 00:02:26,187 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 [2022-02-21 00:02:26,188 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 51 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:26,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 155 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:26,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2022-02-21 00:02:26,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 901. [2022-02-21 00:02:26,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:26,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1191 states. Second operand has 901 states, 900 states have (on average 1.6833333333333333) internal successors, (1515), 900 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:26,198 INFO L74 IsIncluded]: Start isIncluded. First operand 1191 states. Second operand has 901 states, 900 states have (on average 1.6833333333333333) internal successors, (1515), 900 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:26,199 INFO L87 Difference]: Start difference. First operand 1191 states. Second operand has 901 states, 900 states have (on average 1.6833333333333333) internal successors, (1515), 900 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:26,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,240 INFO L93 Difference]: Finished difference Result 1191 states and 2060 transitions. [2022-02-21 00:02:26,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 2060 transitions. [2022-02-21 00:02:26,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:26,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:26,242 INFO L74 IsIncluded]: Start isIncluded. First operand has 901 states, 900 states have (on average 1.6833333333333333) internal successors, (1515), 900 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1191 states. [2022-02-21 00:02:26,243 INFO L87 Difference]: Start difference. First operand has 901 states, 900 states have (on average 1.6833333333333333) internal successors, (1515), 900 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1191 states. [2022-02-21 00:02:26,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,283 INFO L93 Difference]: Finished difference Result 1191 states and 2060 transitions. [2022-02-21 00:02:26,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 2060 transitions. [2022-02-21 00:02:26,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:26,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:26,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:26,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:26,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 1.6833333333333333) internal successors, (1515), 900 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1515 transitions. [2022-02-21 00:02:26,312 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1515 transitions. Word has length 24 [2022-02-21 00:02:26,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:26,312 INFO L470 AbstractCegarLoop]: Abstraction has 901 states and 1515 transitions. [2022-02-21 00:02:26,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:26,312 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1515 transitions. [2022-02-21 00:02:26,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-21 00:02:26,313 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:26,313 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:26,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-21 00:02:26,313 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:26,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:26,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1711089255, now seen corresponding path program 1 times [2022-02-21 00:02:26,314 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:26,314 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719278934] [2022-02-21 00:02:26,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:26,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:26,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {18252#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {18252#true} is VALID [2022-02-21 00:02:26,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {18252#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; {18252#true} is VALID [2022-02-21 00:02:26,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {18252#true} assume !false;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {18252#true} is VALID [2022-02-21 00:02:26,335 INFO L290 TraceCheckUtils]: 3: Hoare triple {18252#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {18252#true} is VALID [2022-02-21 00:02:26,335 INFO L290 TraceCheckUtils]: 4: Hoare triple {18252#true} assume !(0 != main_~p1~0#1); {18252#true} is VALID [2022-02-21 00:02:26,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {18252#true} assume !(0 != main_~p2~0#1); {18252#true} is VALID [2022-02-21 00:02:26,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {18252#true} assume !(0 != main_~p3~0#1); {18252#true} is VALID [2022-02-21 00:02:26,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {18252#true} assume !(0 != main_~p4~0#1); {18252#true} is VALID [2022-02-21 00:02:26,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {18252#true} assume !(0 != main_~p5~0#1); {18254#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:26,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {18254#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {18254#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:26,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {18254#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {18254#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:26,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {18254#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {18254#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:26,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {18254#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {18254#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:26,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {18254#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {18254#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:26,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {18254#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p11~0#1); {18254#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:26,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {18254#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {18254#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:26,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {18254#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {18254#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:26,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {18254#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p1~0#1); {18254#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:26,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {18254#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p2~0#1); {18254#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:26,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {18254#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p3~0#1); {18254#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:26,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {18254#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p4~0#1); {18254#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:26,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {18254#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p5~0#1; {18253#false} is VALID [2022-02-21 00:02:26,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {18253#false} assume 1 != main_~lk5~0#1; {18253#false} is VALID [2022-02-21 00:02:26,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {18253#false} assume !false; {18253#false} is VALID [2022-02-21 00:02:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:26,339 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:26,339 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719278934] [2022-02-21 00:02:26,339 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719278934] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:26,339 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:26,339 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:26,339 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163098509] [2022-02-21 00:02:26,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:26,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-21 00:02:26,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:26,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:26,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:26,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:26,351 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:26,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:26,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:26,352 INFO L87 Difference]: Start difference. First operand 901 states and 1515 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:26,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,475 INFO L93 Difference]: Finished difference Result 1255 states and 2100 transitions. [2022-02-21 00:02:26,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:26,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-21 00:02:26,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:26,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2022-02-21 00:02:26,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:26,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2022-02-21 00:02:26,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 153 transitions. [2022-02-21 00:02:26,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:26,596 INFO L225 Difference]: With dead ends: 1255 [2022-02-21 00:02:26,596 INFO L226 Difference]: Without dead ends: 1255 [2022-02-21 00:02:26,597 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 [2022-02-21 00:02:26,597 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 59 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:26,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 189 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:26,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2022-02-21 00:02:26,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1253. [2022-02-21 00:02:26,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:26,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1255 states. Second operand has 1253 states, 1252 states have (on average 1.676517571884984) internal successors, (2099), 1252 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:26,611 INFO L74 IsIncluded]: Start isIncluded. First operand 1255 states. Second operand has 1253 states, 1252 states have (on average 1.676517571884984) internal successors, (2099), 1252 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:26,612 INFO L87 Difference]: Start difference. First operand 1255 states. Second operand has 1253 states, 1252 states have (on average 1.676517571884984) internal successors, (2099), 1252 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:26,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,657 INFO L93 Difference]: Finished difference Result 1255 states and 2100 transitions. [2022-02-21 00:02:26,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 2100 transitions. [2022-02-21 00:02:26,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:26,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:26,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 1253 states, 1252 states have (on average 1.676517571884984) internal successors, (2099), 1252 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1255 states. [2022-02-21 00:02:26,660 INFO L87 Difference]: Start difference. First operand has 1253 states, 1252 states have (on average 1.676517571884984) internal successors, (2099), 1252 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1255 states. [2022-02-21 00:02:26,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,705 INFO L93 Difference]: Finished difference Result 1255 states and 2100 transitions. [2022-02-21 00:02:26,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 2100 transitions. [2022-02-21 00:02:26,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:26,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:26,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:26,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:26,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1252 states have (on average 1.676517571884984) internal successors, (2099), 1252 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:26,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 2099 transitions. [2022-02-21 00:02:26,754 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 2099 transitions. Word has length 24 [2022-02-21 00:02:26,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:26,754 INFO L470 AbstractCegarLoop]: Abstraction has 1253 states and 2099 transitions. [2022-02-21 00:02:26,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:26,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 2099 transitions. [2022-02-21 00:02:26,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-21 00:02:26,755 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:26,755 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:26,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-21 00:02:26,756 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:26,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:26,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1202246301, now seen corresponding path program 1 times [2022-02-21 00:02:26,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:26,756 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379347387] [2022-02-21 00:02:26,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:26,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:26,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {23275#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {23275#true} is VALID [2022-02-21 00:02:26,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {23275#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; {23275#true} is VALID [2022-02-21 00:02:26,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {23275#true} assume !false;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {23275#true} is VALID [2022-02-21 00:02:26,780 INFO L290 TraceCheckUtils]: 3: Hoare triple {23275#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {23275#true} is VALID [2022-02-21 00:02:26,780 INFO L290 TraceCheckUtils]: 4: Hoare triple {23275#true} assume !(0 != main_~p1~0#1); {23275#true} is VALID [2022-02-21 00:02:26,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {23275#true} assume !(0 != main_~p2~0#1); {23275#true} is VALID [2022-02-21 00:02:26,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {23275#true} assume !(0 != main_~p3~0#1); {23275#true} is VALID [2022-02-21 00:02:26,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {23275#true} assume !(0 != main_~p4~0#1); {23275#true} is VALID [2022-02-21 00:02:26,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {23275#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {23277#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:26,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {23277#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {23277#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:26,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {23277#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {23277#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:26,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {23277#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {23277#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:26,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {23277#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {23277#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:26,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {23277#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {23277#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:26,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {23277#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p11~0#1); {23277#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:26,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {23277#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {23277#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:26,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {23277#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {23277#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:26,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {23277#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p1~0#1); {23277#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:26,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {23277#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p2~0#1); {23277#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:26,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {23277#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p3~0#1); {23277#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:26,784 INFO L290 TraceCheckUtils]: 20: Hoare triple {23277#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p4~0#1); {23277#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:26,784 INFO L290 TraceCheckUtils]: 21: Hoare triple {23277#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p5~0#1); {23276#false} is VALID [2022-02-21 00:02:26,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {23276#false} assume 0 != main_~p6~0#1; {23276#false} is VALID [2022-02-21 00:02:26,784 INFO L290 TraceCheckUtils]: 23: Hoare triple {23276#false} assume 1 != main_~lk6~0#1; {23276#false} is VALID [2022-02-21 00:02:26,785 INFO L290 TraceCheckUtils]: 24: Hoare triple {23276#false} assume !false; {23276#false} is VALID [2022-02-21 00:02:26,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:26,785 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:26,785 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379347387] [2022-02-21 00:02:26,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379347387] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:26,785 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:26,785 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:26,785 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793948694] [2022-02-21 00:02:26,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:26,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-02-21 00:02:26,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:26,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:26,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:26,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:26,799 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:26,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:26,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:26,800 INFO L87 Difference]: Start difference. First operand 1253 states and 2099 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:26,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,906 INFO L93 Difference]: Finished difference Result 1271 states and 2100 transitions. [2022-02-21 00:02:26,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:26,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-02-21 00:02:26,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:26,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:26,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2022-02-21 00:02:26,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:26,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2022-02-21 00:02:26,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 152 transitions. [2022-02-21 00:02:26,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:27,028 INFO L225 Difference]: With dead ends: 1271 [2022-02-21 00:02:27,028 INFO L226 Difference]: Without dead ends: 1271 [2022-02-21 00:02:27,029 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 [2022-02-21 00:02:27,029 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 61 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:27,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 192 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:27,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2022-02-21 00:02:27,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1269. [2022-02-21 00:02:27,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:27,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1271 states. Second operand has 1269 states, 1268 states have (on average 1.6553627760252365) internal successors, (2099), 1268 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:27,046 INFO L74 IsIncluded]: Start isIncluded. First operand 1271 states. Second operand has 1269 states, 1268 states have (on average 1.6553627760252365) internal successors, (2099), 1268 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:27,047 INFO L87 Difference]: Start difference. First operand 1271 states. Second operand has 1269 states, 1268 states have (on average 1.6553627760252365) internal successors, (2099), 1268 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:27,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:27,092 INFO L93 Difference]: Finished difference Result 1271 states and 2100 transitions. [2022-02-21 00:02:27,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 2100 transitions. [2022-02-21 00:02:27,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:27,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:27,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 1269 states, 1268 states have (on average 1.6553627760252365) internal successors, (2099), 1268 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1271 states. [2022-02-21 00:02:27,096 INFO L87 Difference]: Start difference. First operand has 1269 states, 1268 states have (on average 1.6553627760252365) internal successors, (2099), 1268 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1271 states. [2022-02-21 00:02:27,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:27,139 INFO L93 Difference]: Finished difference Result 1271 states and 2100 transitions. [2022-02-21 00:02:27,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 2100 transitions. [2022-02-21 00:02:27,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:27,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:27,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:27,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:27,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 1268 states have (on average 1.6553627760252365) internal successors, (2099), 1268 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 2099 transitions. [2022-02-21 00:02:27,210 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 2099 transitions. Word has length 25 [2022-02-21 00:02:27,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:27,211 INFO L470 AbstractCegarLoop]: Abstraction has 1269 states and 2099 transitions. [2022-02-21 00:02:27,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:27,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 2099 transitions. [2022-02-21 00:02:27,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-21 00:02:27,212 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:27,212 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:27,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-21 00:02:27,212 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:27,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:27,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1504373093, now seen corresponding path program 1 times [2022-02-21 00:02:27,212 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:27,213 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28914388] [2022-02-21 00:02:27,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:27,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:27,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {28362#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {28362#true} is VALID [2022-02-21 00:02:27,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {28362#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; {28362#true} is VALID [2022-02-21 00:02:27,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {28362#true} assume !false;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {28362#true} is VALID [2022-02-21 00:02:27,234 INFO L290 TraceCheckUtils]: 3: Hoare triple {28362#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {28362#true} is VALID [2022-02-21 00:02:27,234 INFO L290 TraceCheckUtils]: 4: Hoare triple {28362#true} assume !(0 != main_~p1~0#1); {28362#true} is VALID [2022-02-21 00:02:27,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {28362#true} assume !(0 != main_~p2~0#1); {28362#true} is VALID [2022-02-21 00:02:27,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {28362#true} assume !(0 != main_~p3~0#1); {28362#true} is VALID [2022-02-21 00:02:27,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {28362#true} assume !(0 != main_~p4~0#1); {28362#true} is VALID [2022-02-21 00:02:27,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {28362#true} assume !(0 != main_~p5~0#1); {28362#true} is VALID [2022-02-21 00:02:27,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {28362#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:27,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:27,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:27,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:27,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:27,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p11~0#1); {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:27,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:27,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:27,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p1~0#1); {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:27,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p2~0#1); {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:27,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p3~0#1); {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:27,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p4~0#1); {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:27,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p5~0#1); {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:27,257 INFO L290 TraceCheckUtils]: 22: Hoare triple {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p6~0#1; {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:27,258 INFO L290 TraceCheckUtils]: 23: Hoare triple {28364#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 1 != main_~lk6~0#1; {28363#false} is VALID [2022-02-21 00:02:27,258 INFO L290 TraceCheckUtils]: 24: Hoare triple {28363#false} assume !false; {28363#false} is VALID [2022-02-21 00:02:27,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:27,258 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:27,258 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28914388] [2022-02-21 00:02:27,258 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28914388] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:27,258 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:27,258 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:27,258 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180312643] [2022-02-21 00:02:27,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:27,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-02-21 00:02:27,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:27,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:27,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:27,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:27,272 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:27,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:27,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:27,273 INFO L87 Difference]: Start difference. First operand 1269 states and 2099 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:27,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:27,505 INFO L93 Difference]: Finished difference Result 2311 states and 3860 transitions. [2022-02-21 00:02:27,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:27,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-02-21 00:02:27,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:27,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:27,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2022-02-21 00:02:27,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:27,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2022-02-21 00:02:27,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 142 transitions. [2022-02-21 00:02:27,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:27,771 INFO L225 Difference]: With dead ends: 2311 [2022-02-21 00:02:27,772 INFO L226 Difference]: Without dead ends: 2311 [2022-02-21 00:02:27,772 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 [2022-02-21 00:02:27,772 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 48 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:27,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 153 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:27,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2022-02-21 00:02:27,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 1797. [2022-02-21 00:02:27,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:27,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2311 states. Second operand has 1797 states, 1796 states have (on average 1.614142538975501) internal successors, (2899), 1796 states have internal predecessors, (2899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:27,801 INFO L74 IsIncluded]: Start isIncluded. First operand 2311 states. Second operand has 1797 states, 1796 states have (on average 1.614142538975501) internal successors, (2899), 1796 states have internal predecessors, (2899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:27,802 INFO L87 Difference]: Start difference. First operand 2311 states. Second operand has 1797 states, 1796 states have (on average 1.614142538975501) internal successors, (2899), 1796 states have internal predecessors, (2899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:27,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:27,952 INFO L93 Difference]: Finished difference Result 2311 states and 3860 transitions. [2022-02-21 00:02:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 3860 transitions. [2022-02-21 00:02:27,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:27,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:27,957 INFO L74 IsIncluded]: Start isIncluded. First operand has 1797 states, 1796 states have (on average 1.614142538975501) internal successors, (2899), 1796 states have internal predecessors, (2899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2311 states. [2022-02-21 00:02:27,958 INFO L87 Difference]: Start difference. First operand has 1797 states, 1796 states have (on average 1.614142538975501) internal successors, (2899), 1796 states have internal predecessors, (2899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2311 states. [2022-02-21 00:02:28,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:28,099 INFO L93 Difference]: Finished difference Result 2311 states and 3860 transitions. [2022-02-21 00:02:28,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 3860 transitions. [2022-02-21 00:02:28,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:28,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:28,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:28,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:28,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1797 states, 1796 states have (on average 1.614142538975501) internal successors, (2899), 1796 states have internal predecessors, (2899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:28,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2899 transitions. [2022-02-21 00:02:28,190 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2899 transitions. Word has length 25 [2022-02-21 00:02:28,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:28,190 INFO L470 AbstractCegarLoop]: Abstraction has 1797 states and 2899 transitions. [2022-02-21 00:02:28,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:28,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2899 transitions. [2022-02-21 00:02:28,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-21 00:02:28,192 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:28,192 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:28,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-21 00:02:28,192 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:28,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:28,192 INFO L85 PathProgramCache]: Analyzing trace with hash 483304739, now seen corresponding path program 1 times [2022-02-21 00:02:28,192 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:28,192 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101483892] [2022-02-21 00:02:28,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:28,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:28,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {37097#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {37097#true} is VALID [2022-02-21 00:02:28,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {37097#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; {37097#true} is VALID [2022-02-21 00:02:28,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {37097#true} assume !false;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {37097#true} is VALID [2022-02-21 00:02:28,211 INFO L290 TraceCheckUtils]: 3: Hoare triple {37097#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {37097#true} is VALID [2022-02-21 00:02:28,211 INFO L290 TraceCheckUtils]: 4: Hoare triple {37097#true} assume !(0 != main_~p1~0#1); {37097#true} is VALID [2022-02-21 00:02:28,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {37097#true} assume !(0 != main_~p2~0#1); {37097#true} is VALID [2022-02-21 00:02:28,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {37097#true} assume !(0 != main_~p3~0#1); {37097#true} is VALID [2022-02-21 00:02:28,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {37097#true} assume !(0 != main_~p4~0#1); {37097#true} is VALID [2022-02-21 00:02:28,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {37097#true} assume !(0 != main_~p5~0#1); {37097#true} is VALID [2022-02-21 00:02:28,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {37097#true} assume !(0 != main_~p6~0#1); {37099#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:28,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {37099#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {37099#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:28,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {37099#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {37099#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:28,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {37099#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {37099#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:28,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {37099#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {37099#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:28,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {37099#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p11~0#1); {37099#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:28,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {37099#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {37099#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:28,213 INFO L290 TraceCheckUtils]: 16: Hoare triple {37099#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {37099#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:28,214 INFO L290 TraceCheckUtils]: 17: Hoare triple {37099#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p1~0#1); {37099#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:28,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {37099#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p2~0#1); {37099#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:28,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {37099#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p3~0#1); {37099#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:28,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {37099#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p4~0#1); {37099#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:28,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {37099#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p5~0#1); {37099#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:28,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {37099#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p6~0#1; {37098#false} is VALID [2022-02-21 00:02:28,215 INFO L290 TraceCheckUtils]: 23: Hoare triple {37098#false} assume 1 != main_~lk6~0#1; {37098#false} is VALID [2022-02-21 00:02:28,215 INFO L290 TraceCheckUtils]: 24: Hoare triple {37098#false} assume !false; {37098#false} is VALID [2022-02-21 00:02:28,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:28,215 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:28,215 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101483892] [2022-02-21 00:02:28,215 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101483892] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:28,215 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:28,215 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:28,215 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556430025] [2022-02-21 00:02:28,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:28,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-02-21 00:02:28,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:28,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:28,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:28,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:28,240 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:28,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:28,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:28,240 INFO L87 Difference]: Start difference. First operand 1797 states and 2899 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:28,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:28,470 INFO L93 Difference]: Finished difference Result 2471 states and 3972 transitions. [2022-02-21 00:02:28,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:28,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-02-21 00:02:28,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2022-02-21 00:02:28,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2022-02-21 00:02:28,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 151 transitions. [2022-02-21 00:02:28,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:28,706 INFO L225 Difference]: With dead ends: 2471 [2022-02-21 00:02:28,707 INFO L226 Difference]: Without dead ends: 2471 [2022-02-21 00:02:28,707 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 [2022-02-21 00:02:28,707 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 58 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:28,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 190 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:28,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2022-02-21 00:02:28,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2469. [2022-02-21 00:02:28,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:28,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2471 states. Second operand has 2469 states, 2468 states have (on average 1.608995137763371) internal successors, (3971), 2468 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:28,738 INFO L74 IsIncluded]: Start isIncluded. First operand 2471 states. Second operand has 2469 states, 2468 states have (on average 1.608995137763371) internal successors, (3971), 2468 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:28,739 INFO L87 Difference]: Start difference. First operand 2471 states. Second operand has 2469 states, 2468 states have (on average 1.608995137763371) internal successors, (3971), 2468 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:28,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:28,890 INFO L93 Difference]: Finished difference Result 2471 states and 3972 transitions. [2022-02-21 00:02:28,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3972 transitions. [2022-02-21 00:02:28,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:28,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:28,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 2469 states, 2468 states have (on average 1.608995137763371) internal successors, (3971), 2468 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2471 states. [2022-02-21 00:02:28,898 INFO L87 Difference]: Start difference. First operand has 2469 states, 2468 states have (on average 1.608995137763371) internal successors, (3971), 2468 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2471 states. [2022-02-21 00:02:29,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:29,053 INFO L93 Difference]: Finished difference Result 2471 states and 3972 transitions. [2022-02-21 00:02:29,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3972 transitions. [2022-02-21 00:02:29,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:29,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:29,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:29,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:29,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2469 states, 2468 states have (on average 1.608995137763371) internal successors, (3971), 2468 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3971 transitions. [2022-02-21 00:02:29,223 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3971 transitions. Word has length 25 [2022-02-21 00:02:29,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:29,223 INFO L470 AbstractCegarLoop]: Abstraction has 2469 states and 3971 transitions. [2022-02-21 00:02:29,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:29,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3971 transitions. [2022-02-21 00:02:29,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-21 00:02:29,236 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:29,236 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:29,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-21 00:02:29,242 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:29,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:29,243 INFO L85 PathProgramCache]: Analyzing trace with hash -608860292, now seen corresponding path program 1 times [2022-02-21 00:02:29,243 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:29,243 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971830688] [2022-02-21 00:02:29,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:29,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:29,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {46984#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {46984#true} is VALID [2022-02-21 00:02:29,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {46984#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; {46984#true} is VALID [2022-02-21 00:02:29,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {46984#true} assume !false;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {46984#true} is VALID [2022-02-21 00:02:29,270 INFO L290 TraceCheckUtils]: 3: Hoare triple {46984#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {46984#true} is VALID [2022-02-21 00:02:29,270 INFO L290 TraceCheckUtils]: 4: Hoare triple {46984#true} assume !(0 != main_~p1~0#1); {46984#true} is VALID [2022-02-21 00:02:29,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {46984#true} assume !(0 != main_~p2~0#1); {46984#true} is VALID [2022-02-21 00:02:29,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {46984#true} assume !(0 != main_~p3~0#1); {46984#true} is VALID [2022-02-21 00:02:29,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {46984#true} assume !(0 != main_~p4~0#1); {46984#true} is VALID [2022-02-21 00:02:29,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {46984#true} assume !(0 != main_~p5~0#1); {46984#true} is VALID [2022-02-21 00:02:29,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {46984#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {46986#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:29,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {46986#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {46986#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:29,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {46986#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {46986#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:29,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {46986#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {46986#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:29,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {46986#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {46986#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:29,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {46986#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p11~0#1); {46986#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:29,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {46986#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {46986#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:29,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {46986#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {46986#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:29,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {46986#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p1~0#1); {46986#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:29,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {46986#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p2~0#1); {46986#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:29,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {46986#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p3~0#1); {46986#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:29,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {46986#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p4~0#1); {46986#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:29,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {46986#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p5~0#1); {46986#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:29,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {46986#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p6~0#1); {46985#false} is VALID [2022-02-21 00:02:29,274 INFO L290 TraceCheckUtils]: 23: Hoare triple {46985#false} assume 0 != main_~p7~0#1; {46985#false} is VALID [2022-02-21 00:02:29,274 INFO L290 TraceCheckUtils]: 24: Hoare triple {46985#false} assume 1 != main_~lk7~0#1; {46985#false} is VALID [2022-02-21 00:02:29,274 INFO L290 TraceCheckUtils]: 25: Hoare triple {46985#false} assume !false; {46985#false} is VALID [2022-02-21 00:02:29,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:29,274 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:29,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971830688] [2022-02-21 00:02:29,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971830688] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:29,274 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:29,274 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:29,274 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948609371] [2022-02-21 00:02:29,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:29,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-02-21 00:02:29,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:29,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:29,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:29,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:29,289 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:29,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:29,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:29,289 INFO L87 Difference]: Start difference. First operand 2469 states and 3971 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:29,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:29,512 INFO L93 Difference]: Finished difference Result 2503 states and 3972 transitions. [2022-02-21 00:02:29,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:29,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-02-21 00:02:29,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:29,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:29,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2022-02-21 00:02:29,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:29,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2022-02-21 00:02:29,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2022-02-21 00:02:29,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:29,753 INFO L225 Difference]: With dead ends: 2503 [2022-02-21 00:02:29,754 INFO L226 Difference]: Without dead ends: 2503 [2022-02-21 00:02:29,754 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 [2022-02-21 00:02:29,754 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 60 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:29,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 188 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:29,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2022-02-21 00:02:29,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2501. [2022-02-21 00:02:29,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:29,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2503 states. Second operand has 2501 states, 2500 states have (on average 1.5884) internal successors, (3971), 2500 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:29,794 INFO L74 IsIncluded]: Start isIncluded. First operand 2503 states. Second operand has 2501 states, 2500 states have (on average 1.5884) internal successors, (3971), 2500 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:29,796 INFO L87 Difference]: Start difference. First operand 2503 states. Second operand has 2501 states, 2500 states have (on average 1.5884) internal successors, (3971), 2500 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:29,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:29,959 INFO L93 Difference]: Finished difference Result 2503 states and 3972 transitions. [2022-02-21 00:02:29,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 3972 transitions. [2022-02-21 00:02:29,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:29,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:29,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 2501 states, 2500 states have (on average 1.5884) internal successors, (3971), 2500 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2503 states. [2022-02-21 00:02:29,966 INFO L87 Difference]: Start difference. First operand has 2501 states, 2500 states have (on average 1.5884) internal successors, (3971), 2500 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2503 states. [2022-02-21 00:02:30,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:30,120 INFO L93 Difference]: Finished difference Result 2503 states and 3972 transitions. [2022-02-21 00:02:30,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 3972 transitions. [2022-02-21 00:02:30,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:30,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:30,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:30,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:30,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 2500 states have (on average 1.5884) internal successors, (3971), 2500 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:30,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 3971 transitions. [2022-02-21 00:02:30,297 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 3971 transitions. Word has length 26 [2022-02-21 00:02:30,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:30,298 INFO L470 AbstractCegarLoop]: Abstraction has 2501 states and 3971 transitions. [2022-02-21 00:02:30,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:30,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 3971 transitions. [2022-02-21 00:02:30,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-21 00:02:30,299 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:30,299 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:30,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-21 00:02:30,299 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:30,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:30,299 INFO L85 PathProgramCache]: Analyzing trace with hash 2097759102, now seen corresponding path program 1 times [2022-02-21 00:02:30,299 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:30,300 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26510952] [2022-02-21 00:02:30,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:30,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:30,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {56999#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {56999#true} is VALID [2022-02-21 00:02:30,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {56999#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; {56999#true} is VALID [2022-02-21 00:02:30,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {56999#true} assume !false;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {56999#true} is VALID [2022-02-21 00:02:30,342 INFO L290 TraceCheckUtils]: 3: Hoare triple {56999#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {56999#true} is VALID [2022-02-21 00:02:30,342 INFO L290 TraceCheckUtils]: 4: Hoare triple {56999#true} assume !(0 != main_~p1~0#1); {56999#true} is VALID [2022-02-21 00:02:30,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {56999#true} assume !(0 != main_~p2~0#1); {56999#true} is VALID [2022-02-21 00:02:30,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {56999#true} assume !(0 != main_~p3~0#1); {56999#true} is VALID [2022-02-21 00:02:30,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {56999#true} assume !(0 != main_~p4~0#1); {56999#true} is VALID [2022-02-21 00:02:30,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {56999#true} assume !(0 != main_~p5~0#1); {56999#true} is VALID [2022-02-21 00:02:30,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {56999#true} assume !(0 != main_~p6~0#1); {56999#true} is VALID [2022-02-21 00:02:30,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {56999#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:30,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:30,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:30,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:30,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p11~0#1); {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:30,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:30,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:30,344 INFO L290 TraceCheckUtils]: 17: Hoare triple {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p1~0#1); {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:30,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p2~0#1); {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:30,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p3~0#1); {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:30,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p4~0#1); {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:30,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p5~0#1); {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:30,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p6~0#1); {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:30,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p7~0#1; {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:30,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {57001#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 1 != main_~lk7~0#1; {57000#false} is VALID [2022-02-21 00:02:30,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {57000#false} assume !false; {57000#false} is VALID [2022-02-21 00:02:30,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:30,346 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:30,347 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26510952] [2022-02-21 00:02:30,347 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26510952] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:30,347 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:30,347 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:30,347 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442637311] [2022-02-21 00:02:30,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:30,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-02-21 00:02:30,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:30,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:30,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:30,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:30,361 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:30,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:30,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:30,361 INFO L87 Difference]: Start difference. First operand 2501 states and 3971 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:30,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:30,966 INFO L93 Difference]: Finished difference Result 4487 states and 7204 transitions. [2022-02-21 00:02:30,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:30,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-02-21 00:02:30,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:30,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:30,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2022-02-21 00:02:30,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:30,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2022-02-21 00:02:30,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2022-02-21 00:02:31,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:31,598 INFO L225 Difference]: With dead ends: 4487 [2022-02-21 00:02:31,599 INFO L226 Difference]: Without dead ends: 4487 [2022-02-21 00:02:31,599 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 [2022-02-21 00:02:31,605 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 45 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:31,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:31,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4487 states. [2022-02-21 00:02:31,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4487 to 3589. [2022-02-21 00:02:31,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:31,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4487 states. Second operand has 3589 states, 3588 states have (on average 1.5437569676700111) internal successors, (5539), 3588 states have internal predecessors, (5539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:31,654 INFO L74 IsIncluded]: Start isIncluded. First operand 4487 states. Second operand has 3589 states, 3588 states have (on average 1.5437569676700111) internal successors, (5539), 3588 states have internal predecessors, (5539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:31,656 INFO L87 Difference]: Start difference. First operand 4487 states. Second operand has 3589 states, 3588 states have (on average 1.5437569676700111) internal successors, (5539), 3588 states have internal predecessors, (5539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:32,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:32,202 INFO L93 Difference]: Finished difference Result 4487 states and 7204 transitions. [2022-02-21 00:02:32,203 INFO L276 IsEmpty]: Start isEmpty. Operand 4487 states and 7204 transitions. [2022-02-21 00:02:32,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:32,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:32,209 INFO L74 IsIncluded]: Start isIncluded. First operand has 3589 states, 3588 states have (on average 1.5437569676700111) internal successors, (5539), 3588 states have internal predecessors, (5539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 4487 states. [2022-02-21 00:02:32,211 INFO L87 Difference]: Start difference. First operand has 3589 states, 3588 states have (on average 1.5437569676700111) internal successors, (5539), 3588 states have internal predecessors, (5539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 4487 states. [2022-02-21 00:02:32,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:32,767 INFO L93 Difference]: Finished difference Result 4487 states and 7204 transitions. [2022-02-21 00:02:32,767 INFO L276 IsEmpty]: Start isEmpty. Operand 4487 states and 7204 transitions. [2022-02-21 00:02:32,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:32,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:32,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:32,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:32,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3589 states, 3588 states have (on average 1.5437569676700111) internal successors, (5539), 3588 states have internal predecessors, (5539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:33,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3589 states to 3589 states and 5539 transitions. [2022-02-21 00:02:33,129 INFO L78 Accepts]: Start accepts. Automaton has 3589 states and 5539 transitions. Word has length 26 [2022-02-21 00:02:33,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:33,129 INFO L470 AbstractCegarLoop]: Abstraction has 3589 states and 5539 transitions. [2022-02-21 00:02:33,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:33,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3589 states and 5539 transitions. [2022-02-21 00:02:33,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-21 00:02:33,131 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:33,131 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:33,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-21 00:02:33,132 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:33,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:33,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1076690748, now seen corresponding path program 1 times [2022-02-21 00:02:33,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:33,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361794922] [2022-02-21 00:02:33,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:33,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:33,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {74054#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {74054#true} is VALID [2022-02-21 00:02:33,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {74054#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; {74054#true} is VALID [2022-02-21 00:02:33,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {74054#true} assume !false;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {74054#true} is VALID [2022-02-21 00:02:33,172 INFO L290 TraceCheckUtils]: 3: Hoare triple {74054#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {74054#true} is VALID [2022-02-21 00:02:33,172 INFO L290 TraceCheckUtils]: 4: Hoare triple {74054#true} assume !(0 != main_~p1~0#1); {74054#true} is VALID [2022-02-21 00:02:33,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {74054#true} assume !(0 != main_~p2~0#1); {74054#true} is VALID [2022-02-21 00:02:33,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {74054#true} assume !(0 != main_~p3~0#1); {74054#true} is VALID [2022-02-21 00:02:33,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {74054#true} assume !(0 != main_~p4~0#1); {74054#true} is VALID [2022-02-21 00:02:33,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {74054#true} assume !(0 != main_~p5~0#1); {74054#true} is VALID [2022-02-21 00:02:33,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {74054#true} assume !(0 != main_~p6~0#1); {74054#true} is VALID [2022-02-21 00:02:33,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {74054#true} assume !(0 != main_~p7~0#1); {74056#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:33,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {74056#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {74056#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:33,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {74056#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {74056#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:33,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {74056#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {74056#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:33,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {74056#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p11~0#1); {74056#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:33,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {74056#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {74056#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:33,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {74056#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {74056#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:33,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {74056#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p1~0#1); {74056#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:33,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {74056#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p2~0#1); {74056#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:33,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {74056#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p3~0#1); {74056#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:33,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {74056#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p4~0#1); {74056#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:33,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {74056#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p5~0#1); {74056#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:33,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {74056#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p6~0#1); {74056#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:33,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {74056#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p7~0#1; {74055#false} is VALID [2022-02-21 00:02:33,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {74055#false} assume 1 != main_~lk7~0#1; {74055#false} is VALID [2022-02-21 00:02:33,176 INFO L290 TraceCheckUtils]: 25: Hoare triple {74055#false} assume !false; {74055#false} is VALID [2022-02-21 00:02:33,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:33,177 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:33,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361794922] [2022-02-21 00:02:33,177 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361794922] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:33,177 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:33,177 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:33,177 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134318095] [2022-02-21 00:02:33,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:33,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-02-21 00:02:33,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:33,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:33,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:33,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:33,192 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:33,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:33,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:33,193 INFO L87 Difference]: Start difference. First operand 3589 states and 5539 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:33,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:33,898 INFO L93 Difference]: Finished difference Result 4871 states and 7492 transitions. [2022-02-21 00:02:33,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:33,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-02-21 00:02:33,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:33,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:33,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2022-02-21 00:02:33,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:33,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2022-02-21 00:02:33,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 149 transitions. [2022-02-21 00:02:33,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:34,647 INFO L225 Difference]: With dead ends: 4871 [2022-02-21 00:02:34,647 INFO L226 Difference]: Without dead ends: 4871 [2022-02-21 00:02:34,648 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 [2022-02-21 00:02:34,648 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 57 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:34,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 191 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:34,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4871 states. [2022-02-21 00:02:34,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4871 to 4869. [2022-02-21 00:02:34,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:34,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4871 states. Second operand has 4869 states, 4868 states have (on average 1.538824979457683) internal successors, (7491), 4868 states have internal predecessors, (7491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:34,732 INFO L74 IsIncluded]: Start isIncluded. First operand 4871 states. Second operand has 4869 states, 4868 states have (on average 1.538824979457683) internal successors, (7491), 4868 states have internal predecessors, (7491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:34,738 INFO L87 Difference]: Start difference. First operand 4871 states. Second operand has 4869 states, 4868 states have (on average 1.538824979457683) internal successors, (7491), 4868 states have internal predecessors, (7491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:35,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,350 INFO L93 Difference]: Finished difference Result 4871 states and 7492 transitions. [2022-02-21 00:02:35,350 INFO L276 IsEmpty]: Start isEmpty. Operand 4871 states and 7492 transitions. [2022-02-21 00:02:35,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:35,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:35,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 4869 states, 4868 states have (on average 1.538824979457683) internal successors, (7491), 4868 states have internal predecessors, (7491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 4871 states. [2022-02-21 00:02:35,364 INFO L87 Difference]: Start difference. First operand has 4869 states, 4868 states have (on average 1.538824979457683) internal successors, (7491), 4868 states have internal predecessors, (7491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 4871 states. [2022-02-21 00:02:35,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,999 INFO L93 Difference]: Finished difference Result 4871 states and 7492 transitions. [2022-02-21 00:02:35,999 INFO L276 IsEmpty]: Start isEmpty. Operand 4871 states and 7492 transitions. [2022-02-21 00:02:36,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:36,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:36,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:36,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:36,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4869 states, 4868 states have (on average 1.538824979457683) internal successors, (7491), 4868 states have internal predecessors, (7491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:36,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 7491 transitions. [2022-02-21 00:02:36,689 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 7491 transitions. Word has length 26 [2022-02-21 00:02:36,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:36,689 INFO L470 AbstractCegarLoop]: Abstraction has 4869 states and 7491 transitions. [2022-02-21 00:02:36,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:36,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 7491 transitions. [2022-02-21 00:02:36,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-21 00:02:36,692 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:36,692 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:36,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-21 00:02:36,693 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:36,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:36,694 INFO L85 PathProgramCache]: Analyzing trace with hash 606237144, now seen corresponding path program 1 times [2022-02-21 00:02:36,694 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:36,694 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373208708] [2022-02-21 00:02:36,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:36,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:36,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {93541#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {93541#true} is VALID [2022-02-21 00:02:36,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {93541#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; {93541#true} is VALID [2022-02-21 00:02:36,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {93541#true} assume !false;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {93541#true} is VALID [2022-02-21 00:02:36,735 INFO L290 TraceCheckUtils]: 3: Hoare triple {93541#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {93541#true} is VALID [2022-02-21 00:02:36,735 INFO L290 TraceCheckUtils]: 4: Hoare triple {93541#true} assume !(0 != main_~p1~0#1); {93541#true} is VALID [2022-02-21 00:02:36,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {93541#true} assume !(0 != main_~p2~0#1); {93541#true} is VALID [2022-02-21 00:02:36,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {93541#true} assume !(0 != main_~p3~0#1); {93541#true} is VALID [2022-02-21 00:02:36,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {93541#true} assume !(0 != main_~p4~0#1); {93541#true} is VALID [2022-02-21 00:02:36,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {93541#true} assume !(0 != main_~p5~0#1); {93541#true} is VALID [2022-02-21 00:02:36,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {93541#true} assume !(0 != main_~p6~0#1); {93541#true} is VALID [2022-02-21 00:02:36,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {93541#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {93543#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:36,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {93543#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {93543#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:36,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {93543#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {93543#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:36,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {93543#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {93543#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:36,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {93543#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p11~0#1); {93543#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:36,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {93543#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {93543#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:36,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {93543#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {93543#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:36,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {93543#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p1~0#1); {93543#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:36,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {93543#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p2~0#1); {93543#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:36,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {93543#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p3~0#1); {93543#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:36,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {93543#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p4~0#1); {93543#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:36,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {93543#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p5~0#1); {93543#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:36,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {93543#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p6~0#1); {93543#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:36,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {93543#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p7~0#1); {93542#false} is VALID [2022-02-21 00:02:36,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {93542#false} assume 0 != main_~p8~0#1; {93542#false} is VALID [2022-02-21 00:02:36,739 INFO L290 TraceCheckUtils]: 25: Hoare triple {93542#false} assume 1 != main_~lk8~0#1; {93542#false} is VALID [2022-02-21 00:02:36,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {93542#false} assume !false; {93542#false} is VALID [2022-02-21 00:02:36,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:36,739 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:36,740 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373208708] [2022-02-21 00:02:36,740 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373208708] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:36,740 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:36,740 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:36,740 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8656148] [2022-02-21 00:02:36,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:36,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-02-21 00:02:36,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:36,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:36,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:36,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:36,755 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:36,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:36,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:36,756 INFO L87 Difference]: Start difference. First operand 4869 states and 7491 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:37,487 INFO L93 Difference]: Finished difference Result 4935 states and 7492 transitions. [2022-02-21 00:02:37,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:37,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-02-21 00:02:37,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:37,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2022-02-21 00:02:37,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2022-02-21 00:02:37,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 148 transitions. [2022-02-21 00:02:37,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:38,161 INFO L225 Difference]: With dead ends: 4935 [2022-02-21 00:02:38,161 INFO L226 Difference]: Without dead ends: 4935 [2022-02-21 00:02:38,162 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 [2022-02-21 00:02:38,163 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 59 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:38,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 184 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:38,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4935 states. [2022-02-21 00:02:38,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4935 to 4933. [2022-02-21 00:02:38,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:38,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4935 states. Second operand has 4933 states, 4932 states have (on average 1.5188564476885644) internal successors, (7491), 4932 states have internal predecessors, (7491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:38,208 INFO L74 IsIncluded]: Start isIncluded. First operand 4935 states. Second operand has 4933 states, 4932 states have (on average 1.5188564476885644) internal successors, (7491), 4932 states have internal predecessors, (7491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:38,212 INFO L87 Difference]: Start difference. First operand 4935 states. Second operand has 4933 states, 4932 states have (on average 1.5188564476885644) internal successors, (7491), 4932 states have internal predecessors, (7491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:38,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:38,862 INFO L93 Difference]: Finished difference Result 4935 states and 7492 transitions. [2022-02-21 00:02:38,862 INFO L276 IsEmpty]: Start isEmpty. Operand 4935 states and 7492 transitions. [2022-02-21 00:02:38,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:38,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:38,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 4933 states, 4932 states have (on average 1.5188564476885644) internal successors, (7491), 4932 states have internal predecessors, (7491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 4935 states. [2022-02-21 00:02:38,873 INFO L87 Difference]: Start difference. First operand has 4933 states, 4932 states have (on average 1.5188564476885644) internal successors, (7491), 4932 states have internal predecessors, (7491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 4935 states. [2022-02-21 00:02:39,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:39,489 INFO L93 Difference]: Finished difference Result 4935 states and 7492 transitions. [2022-02-21 00:02:39,489 INFO L276 IsEmpty]: Start isEmpty. Operand 4935 states and 7492 transitions. [2022-02-21 00:02:39,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:39,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:39,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:39,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:39,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4933 states, 4932 states have (on average 1.5188564476885644) internal successors, (7491), 4932 states have internal predecessors, (7491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:40,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4933 states to 4933 states and 7491 transitions. [2022-02-21 00:02:40,192 INFO L78 Accepts]: Start accepts. Automaton has 4933 states and 7491 transitions. Word has length 27 [2022-02-21 00:02:40,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:40,193 INFO L470 AbstractCegarLoop]: Abstraction has 4933 states and 7491 transitions. [2022-02-21 00:02:40,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:40,193 INFO L276 IsEmpty]: Start isEmpty. Operand 4933 states and 7491 transitions. [2022-02-21 00:02:40,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-21 00:02:40,194 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:40,194 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:40,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-21 00:02:40,195 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:40,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:40,195 INFO L85 PathProgramCache]: Analyzing trace with hash -982110758, now seen corresponding path program 1 times [2022-02-21 00:02:40,195 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:40,195 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891721342] [2022-02-21 00:02:40,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:40,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:40,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {113284#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {113284#true} is VALID [2022-02-21 00:02:40,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {113284#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; {113284#true} is VALID [2022-02-21 00:02:40,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {113284#true} assume !false;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {113284#true} is VALID [2022-02-21 00:02:40,218 INFO L290 TraceCheckUtils]: 3: Hoare triple {113284#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {113284#true} is VALID [2022-02-21 00:02:40,218 INFO L290 TraceCheckUtils]: 4: Hoare triple {113284#true} assume !(0 != main_~p1~0#1); {113284#true} is VALID [2022-02-21 00:02:40,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {113284#true} assume !(0 != main_~p2~0#1); {113284#true} is VALID [2022-02-21 00:02:40,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {113284#true} assume !(0 != main_~p3~0#1); {113284#true} is VALID [2022-02-21 00:02:40,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {113284#true} assume !(0 != main_~p4~0#1); {113284#true} is VALID [2022-02-21 00:02:40,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {113284#true} assume !(0 != main_~p5~0#1); {113284#true} is VALID [2022-02-21 00:02:40,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {113284#true} assume !(0 != main_~p6~0#1); {113284#true} is VALID [2022-02-21 00:02:40,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {113284#true} assume !(0 != main_~p7~0#1); {113284#true} is VALID [2022-02-21 00:02:40,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {113284#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:40,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:40,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:40,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p11~0#1); {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:40,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:40,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:40,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p1~0#1); {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:40,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p2~0#1); {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:40,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p3~0#1); {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:40,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p4~0#1); {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:40,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p5~0#1); {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:40,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p6~0#1); {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:40,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p7~0#1); {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:40,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p8~0#1; {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:40,222 INFO L290 TraceCheckUtils]: 25: Hoare triple {113286#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 1 != main_~lk8~0#1; {113285#false} is VALID [2022-02-21 00:02:40,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {113285#false} assume !false; {113285#false} is VALID [2022-02-21 00:02:40,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:40,223 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:40,223 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891721342] [2022-02-21 00:02:40,223 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891721342] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:40,223 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:40,223 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:40,223 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472567740] [2022-02-21 00:02:40,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:40,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-02-21 00:02:40,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:40,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:40,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:40,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:40,237 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:40,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:40,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:40,238 INFO L87 Difference]: Start difference. First operand 4933 states and 7491 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,239 INFO L93 Difference]: Finished difference Result 8711 states and 13380 transitions. [2022-02-21 00:02:42,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:42,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-02-21 00:02:42,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:42,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2022-02-21 00:02:42,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2022-02-21 00:02:42,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2022-02-21 00:02:42,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:44,379 INFO L225 Difference]: With dead ends: 8711 [2022-02-21 00:02:44,379 INFO L226 Difference]: Without dead ends: 8711 [2022-02-21 00:02:44,379 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 [2022-02-21 00:02:44,380 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 42 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:44,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 149 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:44,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8711 states. [2022-02-21 00:02:44,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8711 to 7173. [2022-02-21 00:02:44,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:44,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8711 states. Second operand has 7173 states, 7172 states have (on average 1.4728109313998885) internal successors, (10563), 7172 states have internal predecessors, (10563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:44,465 INFO L74 IsIncluded]: Start isIncluded. First operand 8711 states. Second operand has 7173 states, 7172 states have (on average 1.4728109313998885) internal successors, (10563), 7172 states have internal predecessors, (10563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:44,473 INFO L87 Difference]: Start difference. First operand 8711 states. Second operand has 7173 states, 7172 states have (on average 1.4728109313998885) internal successors, (10563), 7172 states have internal predecessors, (10563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:46,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:46,410 INFO L93 Difference]: Finished difference Result 8711 states and 13380 transitions. [2022-02-21 00:02:46,410 INFO L276 IsEmpty]: Start isEmpty. Operand 8711 states and 13380 transitions. [2022-02-21 00:02:46,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:46,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:46,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 7173 states, 7172 states have (on average 1.4728109313998885) internal successors, (10563), 7172 states have internal predecessors, (10563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 8711 states. [2022-02-21 00:02:46,428 INFO L87 Difference]: Start difference. First operand has 7173 states, 7172 states have (on average 1.4728109313998885) internal successors, (10563), 7172 states have internal predecessors, (10563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 8711 states. [2022-02-21 00:02:48,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:48,475 INFO L93 Difference]: Finished difference Result 8711 states and 13380 transitions. [2022-02-21 00:02:48,475 INFO L276 IsEmpty]: Start isEmpty. Operand 8711 states and 13380 transitions. [2022-02-21 00:02:48,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:48,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:48,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:48,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:48,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7173 states, 7172 states have (on average 1.4728109313998885) internal successors, (10563), 7172 states have internal predecessors, (10563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7173 states to 7173 states and 10563 transitions. [2022-02-21 00:02:49,945 INFO L78 Accepts]: Start accepts. Automaton has 7173 states and 10563 transitions. Word has length 27 [2022-02-21 00:02:49,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:49,945 INFO L470 AbstractCegarLoop]: Abstraction has 7173 states and 10563 transitions. [2022-02-21 00:02:49,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand 7173 states and 10563 transitions. [2022-02-21 00:02:49,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-21 00:02:49,949 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:49,949 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:49,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-21 00:02:49,949 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:49,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:49,949 INFO L85 PathProgramCache]: Analyzing trace with hash -2003179112, now seen corresponding path program 1 times [2022-02-21 00:02:49,949 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:49,949 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585882072] [2022-02-21 00:02:49,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:49,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:49,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {146595#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {146595#true} is VALID [2022-02-21 00:02:49,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {146595#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; {146595#true} is VALID [2022-02-21 00:02:49,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {146595#true} assume !false;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {146595#true} is VALID [2022-02-21 00:02:49,993 INFO L290 TraceCheckUtils]: 3: Hoare triple {146595#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {146595#true} is VALID [2022-02-21 00:02:49,993 INFO L290 TraceCheckUtils]: 4: Hoare triple {146595#true} assume !(0 != main_~p1~0#1); {146595#true} is VALID [2022-02-21 00:02:49,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {146595#true} assume !(0 != main_~p2~0#1); {146595#true} is VALID [2022-02-21 00:02:49,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {146595#true} assume !(0 != main_~p3~0#1); {146595#true} is VALID [2022-02-21 00:02:49,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {146595#true} assume !(0 != main_~p4~0#1); {146595#true} is VALID [2022-02-21 00:02:49,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {146595#true} assume !(0 != main_~p5~0#1); {146595#true} is VALID [2022-02-21 00:02:49,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {146595#true} assume !(0 != main_~p6~0#1); {146595#true} is VALID [2022-02-21 00:02:49,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {146595#true} assume !(0 != main_~p7~0#1); {146595#true} is VALID [2022-02-21 00:02:49,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {146595#true} assume !(0 != main_~p8~0#1); {146597#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:49,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {146597#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {146597#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:49,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {146597#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {146597#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:49,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {146597#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p11~0#1); {146597#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:49,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {146597#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {146597#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:49,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {146597#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {146597#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:49,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {146597#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p1~0#1); {146597#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:49,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {146597#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p2~0#1); {146597#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:49,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {146597#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p3~0#1); {146597#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:49,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {146597#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p4~0#1); {146597#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:49,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {146597#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p5~0#1); {146597#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:49,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {146597#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p6~0#1); {146597#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:49,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {146597#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p7~0#1); {146597#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:49,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {146597#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p8~0#1; {146596#false} is VALID [2022-02-21 00:02:49,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {146596#false} assume 1 != main_~lk8~0#1; {146596#false} is VALID [2022-02-21 00:02:49,997 INFO L290 TraceCheckUtils]: 26: Hoare triple {146596#false} assume !false; {146596#false} is VALID [2022-02-21 00:02:49,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:49,998 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:49,998 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585882072] [2022-02-21 00:02:49,998 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585882072] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:49,998 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:49,998 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:49,998 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745910575] [2022-02-21 00:02:49,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:49,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-02-21 00:02:49,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:49,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:50,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:50,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:50,012 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:50,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:50,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:50,012 INFO L87 Difference]: Start difference. First operand 7173 states and 10563 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:52,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:52,574 INFO L93 Difference]: Finished difference Result 9607 states and 14084 transitions. [2022-02-21 00:02:52,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:52,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-02-21 00:02:52,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:52,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2022-02-21 00:02:52,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:52,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2022-02-21 00:02:52,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2022-02-21 00:02:52,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:55,223 INFO L225 Difference]: With dead ends: 9607 [2022-02-21 00:02:55,223 INFO L226 Difference]: Without dead ends: 9607 [2022-02-21 00:02:55,223 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 [2022-02-21 00:02:55,223 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 56 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:55,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 192 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:55,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9607 states. [2022-02-21 00:02:55,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9607 to 9605. [2022-02-21 00:02:55,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:55,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9607 states. Second operand has 9605 states, 9604 states have (on average 1.4663681799250312) internal successors, (14083), 9604 states have internal predecessors, (14083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:55,361 INFO L74 IsIncluded]: Start isIncluded. First operand 9607 states. Second operand has 9605 states, 9604 states have (on average 1.4663681799250312) internal successors, (14083), 9604 states have internal predecessors, (14083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:55,368 INFO L87 Difference]: Start difference. First operand 9607 states. Second operand has 9605 states, 9604 states have (on average 1.4663681799250312) internal successors, (14083), 9604 states have internal predecessors, (14083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:57,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:57,828 INFO L93 Difference]: Finished difference Result 9607 states and 14084 transitions. [2022-02-21 00:02:57,828 INFO L276 IsEmpty]: Start isEmpty. Operand 9607 states and 14084 transitions. [2022-02-21 00:02:57,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:57,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:57,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 9605 states, 9604 states have (on average 1.4663681799250312) internal successors, (14083), 9604 states have internal predecessors, (14083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9607 states. [2022-02-21 00:02:57,848 INFO L87 Difference]: Start difference. First operand has 9605 states, 9604 states have (on average 1.4663681799250312) internal successors, (14083), 9604 states have internal predecessors, (14083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9607 states. [2022-02-21 00:03:00,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:00,401 INFO L93 Difference]: Finished difference Result 9607 states and 14084 transitions. [2022-02-21 00:03:00,401 INFO L276 IsEmpty]: Start isEmpty. Operand 9607 states and 14084 transitions. [2022-02-21 00:03:00,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:00,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:00,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:00,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9605 states, 9604 states have (on average 1.4663681799250312) internal successors, (14083), 9604 states have internal predecessors, (14083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:02,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9605 states to 9605 states and 14083 transitions. [2022-02-21 00:03:02,605 INFO L78 Accepts]: Start accepts. Automaton has 9605 states and 14083 transitions. Word has length 27 [2022-02-21 00:03:02,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:02,605 INFO L470 AbstractCegarLoop]: Abstraction has 9605 states and 14083 transitions. [2022-02-21 00:03:02,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:02,605 INFO L276 IsEmpty]: Start isEmpty. Operand 9605 states and 14083 transitions. [2022-02-21 00:03:02,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-21 00:03:02,610 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:02,610 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:02,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-21 00:03:02,610 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:03:02,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:02,611 INFO L85 PathProgramCache]: Analyzing trace with hash -380447663, now seen corresponding path program 1 times [2022-02-21 00:03:02,611 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:02,611 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136552001] [2022-02-21 00:03:02,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:02,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:02,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {185026#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {185026#true} is VALID [2022-02-21 00:03:02,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {185026#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; {185026#true} is VALID [2022-02-21 00:03:02,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {185026#true} assume !false;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {185026#true} is VALID [2022-02-21 00:03:02,643 INFO L290 TraceCheckUtils]: 3: Hoare triple {185026#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {185026#true} is VALID [2022-02-21 00:03:02,643 INFO L290 TraceCheckUtils]: 4: Hoare triple {185026#true} assume !(0 != main_~p1~0#1); {185026#true} is VALID [2022-02-21 00:03:02,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {185026#true} assume !(0 != main_~p2~0#1); {185026#true} is VALID [2022-02-21 00:03:02,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {185026#true} assume !(0 != main_~p3~0#1); {185026#true} is VALID [2022-02-21 00:03:02,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {185026#true} assume !(0 != main_~p4~0#1); {185026#true} is VALID [2022-02-21 00:03:02,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {185026#true} assume !(0 != main_~p5~0#1); {185026#true} is VALID [2022-02-21 00:03:02,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {185026#true} assume !(0 != main_~p6~0#1); {185026#true} is VALID [2022-02-21 00:03:02,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {185026#true} assume !(0 != main_~p7~0#1); {185026#true} is VALID [2022-02-21 00:03:02,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {185026#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {185028#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:02,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {185028#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {185028#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:02,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {185028#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {185028#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:02,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {185028#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p11~0#1); {185028#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:02,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {185028#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {185028#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:02,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {185028#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {185028#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:02,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {185028#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p1~0#1); {185028#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:02,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {185028#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p2~0#1); {185028#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:02,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {185028#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p3~0#1); {185028#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:02,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {185028#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p4~0#1); {185028#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:02,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {185028#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p5~0#1); {185028#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:02,646 INFO L290 TraceCheckUtils]: 22: Hoare triple {185028#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p6~0#1); {185028#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:02,646 INFO L290 TraceCheckUtils]: 23: Hoare triple {185028#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p7~0#1); {185028#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:02,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {185028#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p8~0#1); {185027#false} is VALID [2022-02-21 00:03:02,647 INFO L290 TraceCheckUtils]: 25: Hoare triple {185027#false} assume 0 != main_~p9~0#1; {185027#false} is VALID [2022-02-21 00:03:02,647 INFO L290 TraceCheckUtils]: 26: Hoare triple {185027#false} assume 1 != main_~lk9~0#1; {185027#false} is VALID [2022-02-21 00:03:02,647 INFO L290 TraceCheckUtils]: 27: Hoare triple {185027#false} assume !false; {185027#false} is VALID [2022-02-21 00:03:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:03:02,647 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:02,648 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136552001] [2022-02-21 00:03:02,648 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136552001] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:02,649 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:02,649 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:03:02,649 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038644436] [2022-02-21 00:03:02,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:02,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-02-21 00:03:02,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:02,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:02,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:02,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:03:02,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:02,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:03:02,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:02,664 INFO L87 Difference]: Start difference. First operand 9605 states and 14083 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:05,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:05,206 INFO L93 Difference]: Finished difference Result 9735 states and 14084 transitions. [2022-02-21 00:03:05,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:03:05,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-02-21 00:03:05,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:05,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:05,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2022-02-21 00:03:05,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:05,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2022-02-21 00:03:05,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 146 transitions. [2022-02-21 00:03:05,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:07,909 INFO L225 Difference]: With dead ends: 9735 [2022-02-21 00:03:07,910 INFO L226 Difference]: Without dead ends: 9735 [2022-02-21 00:03:07,910 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 [2022-02-21 00:03:07,910 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 58 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:07,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 180 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:07,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9735 states. [2022-02-21 00:03:07,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9735 to 9733. [2022-02-21 00:03:07,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:08,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9735 states. Second operand has 9733 states, 9732 states have (on average 1.447081792026305) internal successors, (14083), 9732 states have internal predecessors, (14083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:08,013 INFO L74 IsIncluded]: Start isIncluded. First operand 9735 states. Second operand has 9733 states, 9732 states have (on average 1.447081792026305) internal successors, (14083), 9732 states have internal predecessors, (14083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:08,024 INFO L87 Difference]: Start difference. First operand 9735 states. Second operand has 9733 states, 9732 states have (on average 1.447081792026305) internal successors, (14083), 9732 states have internal predecessors, (14083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:10,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:10,547 INFO L93 Difference]: Finished difference Result 9735 states and 14084 transitions. [2022-02-21 00:03:10,547 INFO L276 IsEmpty]: Start isEmpty. Operand 9735 states and 14084 transitions. [2022-02-21 00:03:10,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:10,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:10,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 9733 states, 9732 states have (on average 1.447081792026305) internal successors, (14083), 9732 states have internal predecessors, (14083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9735 states. [2022-02-21 00:03:10,574 INFO L87 Difference]: Start difference. First operand has 9733 states, 9732 states have (on average 1.447081792026305) internal successors, (14083), 9732 states have internal predecessors, (14083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9735 states. [2022-02-21 00:03:12,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:12,964 INFO L93 Difference]: Finished difference Result 9735 states and 14084 transitions. [2022-02-21 00:03:12,964 INFO L276 IsEmpty]: Start isEmpty. Operand 9735 states and 14084 transitions. [2022-02-21 00:03:12,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:12,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:12,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:12,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:12,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9733 states, 9732 states have (on average 1.447081792026305) internal successors, (14083), 9732 states have internal predecessors, (14083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:15,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9733 states to 9733 states and 14083 transitions. [2022-02-21 00:03:15,531 INFO L78 Accepts]: Start accepts. Automaton has 9733 states and 14083 transitions. Word has length 28 [2022-02-21 00:03:15,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:15,531 INFO L470 AbstractCegarLoop]: Abstraction has 9733 states and 14083 transitions. [2022-02-21 00:03:15,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:15,532 INFO L276 IsEmpty]: Start isEmpty. Operand 9733 states and 14083 transitions. [2022-02-21 00:03:15,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-21 00:03:15,535 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:15,535 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:15,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-21 00:03:15,535 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:03:15,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:15,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1968795565, now seen corresponding path program 1 times [2022-02-21 00:03:15,536 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:15,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618004553] [2022-02-21 00:03:15,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:15,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:15,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {223969#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {223969#true} is VALID [2022-02-21 00:03:15,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {223969#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; {223969#true} is VALID [2022-02-21 00:03:15,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {223969#true} assume !false;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {223969#true} is VALID [2022-02-21 00:03:15,557 INFO L290 TraceCheckUtils]: 3: Hoare triple {223969#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; {223969#true} is VALID [2022-02-21 00:03:15,557 INFO L290 TraceCheckUtils]: 4: Hoare triple {223969#true} assume !(0 != main_~p1~0#1); {223969#true} is VALID [2022-02-21 00:03:15,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {223969#true} assume !(0 != main_~p2~0#1); {223969#true} is VALID [2022-02-21 00:03:15,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {223969#true} assume !(0 != main_~p3~0#1); {223969#true} is VALID [2022-02-21 00:03:15,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {223969#true} assume !(0 != main_~p4~0#1); {223969#true} is VALID [2022-02-21 00:03:15,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {223969#true} assume !(0 != main_~p5~0#1); {223969#true} is VALID [2022-02-21 00:03:15,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {223969#true} assume !(0 != main_~p6~0#1); {223969#true} is VALID [2022-02-21 00:03:15,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {223969#true} assume !(0 != main_~p7~0#1); {223969#true} is VALID [2022-02-21 00:03:15,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {223969#true} assume !(0 != main_~p8~0#1); {223969#true} is VALID [2022-02-21 00:03:15,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {223969#true} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:15,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:15,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p11~0#1); {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:15,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:15,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:15,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p1~0#1); {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:15,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p2~0#1); {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:15,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p3~0#1); {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:15,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p4~0#1); {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:15,560 INFO L290 TraceCheckUtils]: 21: Hoare triple {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p5~0#1); {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:15,560 INFO L290 TraceCheckUtils]: 22: Hoare triple {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p6~0#1); {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:15,561 INFO L290 TraceCheckUtils]: 23: Hoare triple {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p7~0#1); {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:15,561 INFO L290 TraceCheckUtils]: 24: Hoare triple {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p8~0#1); {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:15,561 INFO L290 TraceCheckUtils]: 25: Hoare triple {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 0 != main_~p9~0#1; {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:15,561 INFO L290 TraceCheckUtils]: 26: Hoare triple {223971#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 1 != main_~lk9~0#1; {223970#false} is VALID [2022-02-21 00:03:15,562 INFO L290 TraceCheckUtils]: 27: Hoare triple {223970#false} assume !false; {223970#false} is VALID [2022-02-21 00:03:15,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:03:15,562 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:15,562 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618004553] [2022-02-21 00:03:15,562 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618004553] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:15,562 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:15,562 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:03:15,562 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197383784] [2022-02-21 00:03:15,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:15,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-02-21 00:03:15,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:15,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:15,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:15,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:03:15,577 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:15,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:03:15,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:15,577 INFO L87 Difference]: Start difference. First operand 9733 states and 14083 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:22,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:22,953 INFO L93 Difference]: Finished difference Result 16903 states and 24708 transitions. [2022-02-21 00:03:22,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:03:22,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-02-21 00:03:22,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:22,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:22,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2022-02-21 00:03:22,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:22,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2022-02-21 00:03:22,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 130 transitions. [2022-02-21 00:03:23,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:30,714 INFO L225 Difference]: With dead ends: 16903 [2022-02-21 00:03:30,714 INFO L226 Difference]: Without dead ends: 16903 [2022-02-21 00:03:30,715 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 [2022-02-21 00:03:30,715 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 39 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:30,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 147 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:30,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16903 states. [2022-02-21 00:03:30,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16903 to 14341. [2022-02-21 00:03:30,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:30,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16903 states. Second operand has 14341 states, 14340 states have (on average 1.4016039051603906) internal successors, (20099), 14340 states have internal predecessors, (20099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:30,895 INFO L74 IsIncluded]: Start isIncluded. First operand 16903 states. Second operand has 14341 states, 14340 states have (on average 1.4016039051603906) internal successors, (20099), 14340 states have internal predecessors, (20099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:30,910 INFO L87 Difference]: Start difference. First operand 16903 states. Second operand has 14341 states, 14340 states have (on average 1.4016039051603906) internal successors, (20099), 14340 states have internal predecessors, (20099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)