./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_14-1.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_14-1.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 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 00:02:21,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 00:02:21,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 00:02:21,312 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 00:02:21,313 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 00:02:21,314 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 00:02:21,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 00:02:21,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 00:02:21,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 00:02:21,321 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 00:02:21,322 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 00:02:21,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 00:02:21,325 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 00:02:21,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 00:02:21,329 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 00:02:21,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 00:02:21,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 00:02:21,337 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 00:02:21,339 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 00:02:21,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 00:02:21,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 00:02:21,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 00:02:21,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 00:02:21,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 00:02:21,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 00:02:21,359 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 00:02:21,360 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 00:02:21,361 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 00:02:21,362 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 00:02:21,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 00:02:21,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 00:02:21,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 00:02:21,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 00:02:21,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 00:02:21,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 00:02:21,371 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 00:02:21,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 00:02:21,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 00:02:21,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 00:02:21,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 00:02:21,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 00:02:21,375 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:21,397 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 00:02:21,398 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 00:02:21,398 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 00:02:21,398 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 00:02:21,399 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 00:02:21,400 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 00:02:21,400 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 00:02:21,400 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 00:02:21,401 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 00:02:21,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 00:02:21,402 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 00:02:21,402 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 00:02:21,402 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 00:02:21,402 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 00:02:21,402 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 00:02:21,403 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-21 00:02:21,403 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-21 00:02:21,403 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-21 00:02:21,403 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 00:02:21,403 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-21 00:02:21,404 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 00:02:21,404 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 00:02:21,404 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 00:02:21,404 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 00:02:21,404 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 00:02:21,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:21,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 00:02:21,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 00:02:21,405 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 00:02:21,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 00:02:21,406 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 -> 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd [2022-02-21 00:02:21,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 00:02:21,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 00:02:21,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 00:02:21,668 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 00:02:21,668 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 00:02:21,670 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-1.c [2022-02-21 00:02:21,741 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0acf29c58/2075d78ba0d94101be682f5859aff63a/FLAGb2a2fe05f [2022-02-21 00:02:22,233 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 00:02:22,234 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c [2022-02-21 00:02:22,248 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0acf29c58/2075d78ba0d94101be682f5859aff63a/FLAGb2a2fe05f [2022-02-21 00:02:22,715 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0acf29c58/2075d78ba0d94101be682f5859aff63a [2022-02-21 00:02:22,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 00:02:22,719 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 00:02:22,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:22,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 00:02:22,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 00:02:22,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:22" (1/1) ... [2022-02-21 00:02:22,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56c5c440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:22, skipping insertion in model container [2022-02-21 00:02:22,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:22" (1/1) ... [2022-02-21 00:02:22,737 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 00:02:22,766 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 00:02:22,984 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_14-1.c[5283,5296] [2022-02-21 00:02:22,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:23,004 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 00:02:23,043 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_14-1.c[5283,5296] [2022-02-21 00:02:23,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:23,063 INFO L208 MainTranslator]: Completed translation [2022-02-21 00:02:23,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:23 WrapperNode [2022-02-21 00:02:23,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:23,067 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:23,068 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 00:02:23,068 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 00:02:23,075 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:23" (1/1) ... [2022-02-21 00:02:23,091 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:23" (1/1) ... [2022-02-21 00:02:23,130 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 182 [2022-02-21 00:02:23,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:23,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 00:02:23,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 00:02:23,134 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 00:02:23,141 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:23" (1/1) ... [2022-02-21 00:02:23,142 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:23" (1/1) ... [2022-02-21 00:02:23,151 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:23" (1/1) ... [2022-02-21 00:02:23,151 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:23" (1/1) ... [2022-02-21 00:02:23,162 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:23" (1/1) ... [2022-02-21 00:02:23,173 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:23" (1/1) ... [2022-02-21 00:02:23,175 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:23" (1/1) ... [2022-02-21 00:02:23,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 00:02:23,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 00:02:23,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 00:02:23,183 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 00:02:23,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:23" (1/1) ... [2022-02-21 00:02:23,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:23,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:23,221 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:23,236 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:23,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 00:02:23,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 00:02:23,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 00:02:23,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 00:02:23,348 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 00:02:23,350 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 00:02:23,708 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 00:02:23,726 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 00:02:23,727 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 00:02:23,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:23 BoogieIcfgContainer [2022-02-21 00:02:23,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 00:02:23,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 00:02:23,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 00:02:23,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 00:02:23,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 12:02:22" (1/3) ... [2022-02-21 00:02:23,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@649a0dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:23, skipping insertion in model container [2022-02-21 00:02:23,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:23" (2/3) ... [2022-02-21 00:02:23,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@649a0dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:23, skipping insertion in model container [2022-02-21 00:02:23,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:23" (3/3) ... [2022-02-21 00:02:23,737 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2022-02-21 00:02:23,742 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 00:02:23,742 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-21 00:02:23,795 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 00:02:23,802 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:23,803 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-21 00:02:23,824 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 50 states have (on average 1.94) internal successors, (97), 52 states have internal predecessors, (97), 0 states have call successors, (0), 0 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,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 00:02:23,829 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:23,830 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 00:02:23,831 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:23,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:23,836 INFO L85 PathProgramCache]: Analyzing trace with hash 28943010, now seen corresponding path program 1 times [2022-02-21 00:02:23,854 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:23,855 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881446454] [2022-02-21 00:02:23,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:23,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:24,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#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(18, 2);call #Ultimate.allocInit(12, 3); {56#true} is VALID [2022-02-21 00:02:24,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#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_#t~nondet18#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_~p14~0#1, main_~lk14~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;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {56#true} is VALID [2022-02-21 00:02:24,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {56#true} assume !true; {57#false} is VALID [2022-02-21 00:02:24,059 INFO L290 TraceCheckUtils]: 3: Hoare triple {57#false} main_#res#1 := 0; {57#false} is VALID [2022-02-21 00:02:24,059 INFO L290 TraceCheckUtils]: 4: Hoare triple {57#false} assume !(#valid == main_old_#valid#1); {57#false} is VALID [2022-02-21 00:02:24,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:24,061 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:24,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881446454] [2022-02-21 00:02:24,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881446454] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:24,063 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:24,063 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:24,064 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555660242] [2022-02-21 00:02:24,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:24,070 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:24,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:24,074 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:24,093 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:24,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-21 00:02:24,094 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:24,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 00:02:24,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 00:02:24,121 INFO L87 Difference]: Start difference. First operand has 53 states, 50 states have (on average 1.94) internal successors, (97), 52 states have internal predecessors, (97), 0 states have call successors, (0), 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:24,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:24,220 INFO L93 Difference]: Finished difference Result 53 states and 94 transitions. [2022-02-21 00:02:24,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 00:02:24,220 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:24,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:24,222 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:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2022-02-21 00:02:24,231 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:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2022-02-21 00:02:24,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 97 transitions. [2022-02-21 00:02:24,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:24,342 INFO L225 Difference]: With dead ends: 53 [2022-02-21 00:02:24,342 INFO L226 Difference]: Without dead ends: 51 [2022-02-21 00:02:24,344 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:24,358 INFO L933 BasicCegarLoop]: 94 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, 94 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:24,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 94 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:24,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-21 00:02:24,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-02-21 00:02:24,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:24,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 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,419 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 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,420 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 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,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:24,443 INFO L93 Difference]: Finished difference Result 51 states and 92 transitions. [2022-02-21 00:02:24,444 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 92 transitions. [2022-02-21 00:02:24,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:24,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:24,445 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 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 51 states. [2022-02-21 00:02:24,446 INFO L87 Difference]: Start difference. First operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 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 51 states. [2022-02-21 00:02:24,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:24,453 INFO L93 Difference]: Finished difference Result 51 states and 92 transitions. [2022-02-21 00:02:24,453 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 92 transitions. [2022-02-21 00:02:24,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:24,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:24,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:24,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:24,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 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,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 92 transitions. [2022-02-21 00:02:24,476 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 92 transitions. Word has length 5 [2022-02-21 00:02:24,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:24,477 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 92 transitions. [2022-02-21 00:02:24,477 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:24,477 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 92 transitions. [2022-02-21 00:02:24,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 00:02:24,478 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:24,478 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 00:02:24,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 00:02:24,478 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:24,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:24,479 INFO L85 PathProgramCache]: Analyzing trace with hash 889700139, now seen corresponding path program 1 times [2022-02-21 00:02:24,479 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:24,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797605505] [2022-02-21 00:02:24,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:24,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:24,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {266#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(18, 2);call #Ultimate.allocInit(12, 3); {266#true} is VALID [2022-02-21 00:02:24,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {266#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_#t~nondet18#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_~p14~0#1, main_~lk14~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;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {268#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:24,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {268#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {268#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:24,584 INFO L290 TraceCheckUtils]: 3: Hoare triple {268#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume 0 == main_~cond~0#1; {268#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:24,585 INFO L290 TraceCheckUtils]: 4: Hoare triple {268#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} main_#res#1 := 0; {268#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:24,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {268#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {267#false} is VALID [2022-02-21 00:02:24,589 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,589 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:24,590 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797605505] [2022-02-21 00:02:24,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797605505] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:24,595 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:24,595 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:24,596 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676030643] [2022-02-21 00:02:24,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:24,598 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:24,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:24,604 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:24,612 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:24,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:24,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:24,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:24,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:24,614 INFO L87 Difference]: Start difference. First operand 51 states and 92 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:24,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:24,735 INFO L93 Difference]: Finished difference Result 50 states and 91 transitions. [2022-02-21 00:02:24,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:24,736 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:24,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:24,736 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:24,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2022-02-21 00:02:24,741 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:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2022-02-21 00:02:24,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 92 transitions. [2022-02-21 00:02:24,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:24,841 INFO L225 Difference]: With dead ends: 50 [2022-02-21 00:02:24,842 INFO L226 Difference]: Without dead ends: 48 [2022-02-21 00:02:24,845 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:24,848 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 91 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:24,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 91 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:24,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-21 00:02:24,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-02-21 00:02:24,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:24,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 0 states have call successors, (0), 0 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,865 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 0 states have call successors, (0), 0 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,868 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 0 states have call successors, (0), 0 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,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:24,873 INFO L93 Difference]: Finished difference Result 48 states and 89 transitions. [2022-02-21 00:02:24,873 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 89 transitions. [2022-02-21 00:02:24,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:24,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:24,874 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 0 states have call successors, (0), 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:24,876 INFO L87 Difference]: Start difference. First operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 0 states have call successors, (0), 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:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:24,881 INFO L93 Difference]: Finished difference Result 48 states and 89 transitions. [2022-02-21 00:02:24,881 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 89 transitions. [2022-02-21 00:02:24,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:24,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:24,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:24,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:24,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 0 states have call successors, (0), 0 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,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 89 transitions. [2022-02-21 00:02:24,888 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 89 transitions. Word has length 6 [2022-02-21 00:02:24,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:24,889 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 89 transitions. [2022-02-21 00:02:24,890 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:24,890 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 89 transitions. [2022-02-21 00:02:24,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 00:02:24,891 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:24,892 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,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 00:02:24,892 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:24,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:24,893 INFO L85 PathProgramCache]: Analyzing trace with hash 792943379, now seen corresponding path program 1 times [2022-02-21 00:02:24,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:24,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385446463] [2022-02-21 00:02:24,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:24,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:25,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {465#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(18, 2);call #Ultimate.allocInit(12, 3); {465#true} is VALID [2022-02-21 00:02:25,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {465#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_#t~nondet18#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_~p14~0#1, main_~lk14~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;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {465#true} is VALID [2022-02-21 00:02:25,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {465#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {465#true} is VALID [2022-02-21 00:02:25,017 INFO L290 TraceCheckUtils]: 3: Hoare triple {465#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;main_~lk14~0#1 := 0; {465#true} is VALID [2022-02-21 00:02:25,018 INFO L290 TraceCheckUtils]: 4: Hoare triple {465#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume !(0 != main_~p3~0#1); {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume !(0 != main_~p11~0#1); {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p1~0#1; {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:25,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {467#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 1 != main_~lk1~0#1; {466#false} is VALID [2022-02-21 00:02:25,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {466#false} assume !false; {466#false} is VALID [2022-02-21 00:02:25,029 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,029 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:25,029 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385446463] [2022-02-21 00:02:25,029 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385446463] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:25,030 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:25,030 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:25,030 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611839642] [2022-02-21 00:02:25,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:25,032 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:25,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:25,032 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:25,053 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:25,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:25,054 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:25,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:25,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:25,055 INFO L87 Difference]: Start difference. First operand 48 states and 89 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:25,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,187 INFO L93 Difference]: Finished difference Result 93 states and 173 transitions. [2022-02-21 00:02:25,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:25,187 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:25,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:25,188 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:25,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2022-02-21 00:02:25,191 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:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2022-02-21 00:02:25,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 174 transitions. [2022-02-21 00:02:25,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:25,347 INFO L225 Difference]: With dead ends: 93 [2022-02-21 00:02:25,347 INFO L226 Difference]: Without dead ends: 93 [2022-02-21 00:02:25,347 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,348 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 68 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 175 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,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 175 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,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-21 00:02:25,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 63. [2022-02-21 00:02:25,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:25,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 0 states have call successors, (0), 0 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,359 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 0 states have call successors, (0), 0 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,359 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 0 states have call successors, (0), 0 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,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,362 INFO L93 Difference]: Finished difference Result 93 states and 173 transitions. [2022-02-21 00:02:25,363 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 173 transitions. [2022-02-21 00:02:25,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:25,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:25,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 0 states have call successors, (0), 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 93 states. [2022-02-21 00:02:25,364 INFO L87 Difference]: Start difference. First operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 0 states have call successors, (0), 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 93 states. [2022-02-21 00:02:25,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,368 INFO L93 Difference]: Finished difference Result 93 states and 173 transitions. [2022-02-21 00:02:25,368 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 173 transitions. [2022-02-21 00:02:25,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:25,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:25,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:25,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:25,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 0 states have call successors, (0), 0 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,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 118 transitions. [2022-02-21 00:02:25,372 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 118 transitions. Word has length 21 [2022-02-21 00:02:25,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:25,372 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 118 transitions. [2022-02-21 00:02:25,373 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:25,373 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 118 transitions. [2022-02-21 00:02:25,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 00:02:25,374 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:25,374 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:25,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 00:02:25,374 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:25,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:25,375 INFO L85 PathProgramCache]: Analyzing trace with hash -795404523, now seen corresponding path program 1 times [2022-02-21 00:02:25,375 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:25,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379875889] [2022-02-21 00:02:25,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:25,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:25,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {812#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(18, 2);call #Ultimate.allocInit(12, 3); {812#true} is VALID [2022-02-21 00:02:25,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {812#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_#t~nondet18#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_~p14~0#1, main_~lk14~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;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {812#true} is VALID [2022-02-21 00:02:25,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {812#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {812#true} is VALID [2022-02-21 00:02:25,432 INFO L290 TraceCheckUtils]: 3: Hoare triple {812#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;main_~lk14~0#1 := 0; {812#true} is VALID [2022-02-21 00:02:25,433 INFO L290 TraceCheckUtils]: 4: Hoare triple {812#true} assume !(0 != main_~p1~0#1); {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:25,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:25,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume !(0 != main_~p3~0#1); {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:25,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:25,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:25,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:25,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:25,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:25,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:25,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:25,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume !(0 != main_~p11~0#1); {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:25,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:25,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:25,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:25,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {814#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p1~0#1; {813#false} is VALID [2022-02-21 00:02:25,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {813#false} assume 1 != main_~lk1~0#1; {813#false} is VALID [2022-02-21 00:02:25,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {813#false} assume !false; {813#false} is VALID [2022-02-21 00:02:25,446 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,446 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:25,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379875889] [2022-02-21 00:02:25,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379875889] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:25,447 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:25,447 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:25,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663236840] [2022-02-21 00:02:25,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:25,448 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:25,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:25,449 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:25,465 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:25,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:25,466 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:25,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:25,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:25,468 INFO L87 Difference]: Start difference. First operand 63 states and 118 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:25,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,573 INFO L93 Difference]: Finished difference Result 93 states and 171 transitions. [2022-02-21 00:02:25,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:25,573 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:25,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:25,573 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:25,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2022-02-21 00:02:25,576 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:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2022-02-21 00:02:25,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 173 transitions. [2022-02-21 00:02:25,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:25,709 INFO L225 Difference]: With dead ends: 93 [2022-02-21 00:02:25,710 INFO L226 Difference]: Without dead ends: 93 [2022-02-21 00:02:25,710 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,714 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 68 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 199 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,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 199 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,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-21 00:02:25,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2022-02-21 00:02:25,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:25,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 91 states, 90 states have (on average 1.8888888888888888) internal successors, (170), 90 states have internal predecessors, (170), 0 states have call successors, (0), 0 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,721 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 91 states, 90 states have (on average 1.8888888888888888) internal successors, (170), 90 states have internal predecessors, (170), 0 states have call successors, (0), 0 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,722 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 91 states, 90 states have (on average 1.8888888888888888) internal successors, (170), 90 states have internal predecessors, (170), 0 states have call successors, (0), 0 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,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,725 INFO L93 Difference]: Finished difference Result 93 states and 171 transitions. [2022-02-21 00:02:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 171 transitions. [2022-02-21 00:02:25,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:25,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:25,726 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 90 states have (on average 1.8888888888888888) internal successors, (170), 90 states have internal predecessors, (170), 0 states have call successors, (0), 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 93 states. [2022-02-21 00:02:25,726 INFO L87 Difference]: Start difference. First operand has 91 states, 90 states have (on average 1.8888888888888888) internal successors, (170), 90 states have internal predecessors, (170), 0 states have call successors, (0), 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 93 states. [2022-02-21 00:02:25,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,729 INFO L93 Difference]: Finished difference Result 93 states and 171 transitions. [2022-02-21 00:02:25,730 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 171 transitions. [2022-02-21 00:02:25,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:25,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:25,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:25,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:25,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.8888888888888888) internal successors, (170), 90 states have internal predecessors, (170), 0 states have call successors, (0), 0 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,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 170 transitions. [2022-02-21 00:02:25,734 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 170 transitions. Word has length 21 [2022-02-21 00:02:25,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:25,735 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 170 transitions. [2022-02-21 00:02:25,735 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:25,735 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 170 transitions. [2022-02-21 00:02:25,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-21 00:02:25,736 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:25,736 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:25,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 00:02:25,736 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:25,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:25,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1188346975, now seen corresponding path program 1 times [2022-02-21 00:02:25,737 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:25,738 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075780848] [2022-02-21 00:02:25,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:25,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:25,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {1187#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(18, 2);call #Ultimate.allocInit(12, 3); {1187#true} is VALID [2022-02-21 00:02:25,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {1187#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_#t~nondet18#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_~p14~0#1, main_~lk14~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;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {1187#true} is VALID [2022-02-21 00:02:25,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {1187#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {1187#true} is VALID [2022-02-21 00:02:25,791 INFO L290 TraceCheckUtils]: 3: Hoare triple {1187#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;main_~lk14~0#1 := 0; {1187#true} is VALID [2022-02-21 00:02:25,792 INFO L290 TraceCheckUtils]: 4: Hoare triple {1187#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:25,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:25,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p3~0#1); {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:25,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:25,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:25,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:25,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:25,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:25,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:25,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:25,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p11~0#1); {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:25,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:25,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:25,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:25,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {1189#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p1~0#1); {1188#false} is VALID [2022-02-21 00:02:25,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {1188#false} assume 0 != main_~p2~0#1; {1188#false} is VALID [2022-02-21 00:02:25,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {1188#false} assume 1 != main_~lk2~0#1; {1188#false} is VALID [2022-02-21 00:02:25,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {1188#false} assume !false; {1188#false} is VALID [2022-02-21 00:02:25,799 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,800 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:25,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075780848] [2022-02-21 00:02:25,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075780848] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:25,800 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:25,800 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:25,801 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590821282] [2022-02-21 00:02:25,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:25,801 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:25,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:25,802 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:25,818 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:25,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:25,819 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:25,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:25,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:25,820 INFO L87 Difference]: Start difference. First operand 91 states and 170 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:25,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,934 INFO L93 Difference]: Finished difference Result 96 states and 173 transitions. [2022-02-21 00:02:25,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:25,934 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:25,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:25,935 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:25,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2022-02-21 00:02:25,937 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:25,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2022-02-21 00:02:25,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 172 transitions. [2022-02-21 00:02:26,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:26,081 INFO L225 Difference]: With dead ends: 96 [2022-02-21 00:02:26,081 INFO L226 Difference]: Without dead ends: 96 [2022-02-21 00:02:26,081 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,082 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 70 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 224 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:26,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 224 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:26,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-02-21 00:02:26,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2022-02-21 00:02:26,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:26,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 0 states have call successors, (0), 0 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,088 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 0 states have call successors, (0), 0 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,089 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 0 states have call successors, (0), 0 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,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,091 INFO L93 Difference]: Finished difference Result 96 states and 173 transitions. [2022-02-21 00:02:26,092 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 173 transitions. [2022-02-21 00:02:26,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:26,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:26,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 0 states have call successors, (0), 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 96 states. [2022-02-21 00:02:26,093 INFO L87 Difference]: Start difference. First operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 0 states have call successors, (0), 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 96 states. [2022-02-21 00:02:26,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,096 INFO L93 Difference]: Finished difference Result 96 states and 173 transitions. [2022-02-21 00:02:26,096 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 173 transitions. [2022-02-21 00:02:26,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:26,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:26,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:26,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:26,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 0 states have call successors, (0), 0 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,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 172 transitions. [2022-02-21 00:02:26,100 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 172 transitions. Word has length 22 [2022-02-21 00:02:26,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:26,101 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 172 transitions. [2022-02-21 00:02:26,101 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:26,101 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 172 transitions. [2022-02-21 00:02:26,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-21 00:02:26,102 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:26,102 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:26,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 00:02:26,102 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:26,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:26,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1112475615, now seen corresponding path program 1 times [2022-02-21 00:02:26,103 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:26,103 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249610707] [2022-02-21 00:02:26,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:26,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:26,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {1574#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(18, 2);call #Ultimate.allocInit(12, 3); {1574#true} is VALID [2022-02-21 00:02:26,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {1574#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_#t~nondet18#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_~p14~0#1, main_~lk14~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;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {1574#true} is VALID [2022-02-21 00:02:26,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {1574#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {1574#true} is VALID [2022-02-21 00:02:26,147 INFO L290 TraceCheckUtils]: 3: Hoare triple {1574#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;main_~lk14~0#1 := 0; {1574#true} is VALID [2022-02-21 00:02:26,148 INFO L290 TraceCheckUtils]: 4: Hoare triple {1574#true} assume !(0 != main_~p1~0#1); {1574#true} is VALID [2022-02-21 00:02:26,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {1574#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:26,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p3~0#1); {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:26,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:26,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:26,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:26,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:26,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:26,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:26,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:26,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p11~0#1); {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:26,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:26,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:26,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:26,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p1~0#1); {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:26,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p2~0#1; {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:26,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {1576#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 1 != main_~lk2~0#1; {1575#false} is VALID [2022-02-21 00:02:26,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {1575#false} assume !false; {1575#false} is VALID [2022-02-21 00:02:26,155 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,155 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:26,156 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249610707] [2022-02-21 00:02:26,156 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249610707] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:26,156 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:26,156 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:26,156 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075047682] [2022-02-21 00:02:26,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:26,157 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:26,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:26,157 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:26,174 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:26,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:26,175 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:26,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:26,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:26,176 INFO L87 Difference]: Start difference. First operand 94 states and 172 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:26,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,282 INFO L93 Difference]: Finished difference Result 179 states and 330 transitions. [2022-02-21 00:02:26,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:26,283 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:26,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:26,283 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:26,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2022-02-21 00:02:26,285 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:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2022-02-21 00:02:26,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 170 transitions. [2022-02-21 00:02:26,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:26,417 INFO L225 Difference]: With dead ends: 179 [2022-02-21 00:02:26,417 INFO L226 Difference]: Without dead ends: 179 [2022-02-21 00:02:26,418 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,418 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 65 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 173 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,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 173 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,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-02-21 00:02:26,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 125. [2022-02-21 00:02:26,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:26,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 125 states, 124 states have (on average 1.846774193548387) internal successors, (229), 124 states have internal predecessors, (229), 0 states have call successors, (0), 0 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,425 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 125 states, 124 states have (on average 1.846774193548387) internal successors, (229), 124 states have internal predecessors, (229), 0 states have call successors, (0), 0 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,426 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 125 states, 124 states have (on average 1.846774193548387) internal successors, (229), 124 states have internal predecessors, (229), 0 states have call successors, (0), 0 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,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,431 INFO L93 Difference]: Finished difference Result 179 states and 330 transitions. [2022-02-21 00:02:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 330 transitions. [2022-02-21 00:02:26,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:26,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:26,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 124 states have (on average 1.846774193548387) internal successors, (229), 124 states have internal predecessors, (229), 0 states have call successors, (0), 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 179 states. [2022-02-21 00:02:26,433 INFO L87 Difference]: Start difference. First operand has 125 states, 124 states have (on average 1.846774193548387) internal successors, (229), 124 states have internal predecessors, (229), 0 states have call successors, (0), 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 179 states. [2022-02-21 00:02:26,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,439 INFO L93 Difference]: Finished difference Result 179 states and 330 transitions. [2022-02-21 00:02:26,440 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 330 transitions. [2022-02-21 00:02:26,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:26,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:26,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:26,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:26,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.846774193548387) internal successors, (229), 124 states have internal predecessors, (229), 0 states have call successors, (0), 0 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,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 229 transitions. [2022-02-21 00:02:26,446 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 229 transitions. Word has length 22 [2022-02-21 00:02:26,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:26,447 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 229 transitions. [2022-02-21 00:02:26,447 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:26,447 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 229 transitions. [2022-02-21 00:02:26,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-21 00:02:26,448 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:26,448 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:26,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 00:02:26,449 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:26,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:26,450 INFO L85 PathProgramCache]: Analyzing trace with hash -475872287, now seen corresponding path program 1 times [2022-02-21 00:02:26,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:26,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10252807] [2022-02-21 00:02:26,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:26,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:26,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {2241#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(18, 2);call #Ultimate.allocInit(12, 3); {2241#true} is VALID [2022-02-21 00:02:26,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {2241#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_#t~nondet18#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_~p14~0#1, main_~lk14~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;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {2241#true} is VALID [2022-02-21 00:02:26,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {2241#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {2241#true} is VALID [2022-02-21 00:02:26,529 INFO L290 TraceCheckUtils]: 3: Hoare triple {2241#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;main_~lk14~0#1 := 0; {2241#true} is VALID [2022-02-21 00:02:26,530 INFO L290 TraceCheckUtils]: 4: Hoare triple {2241#true} assume !(0 != main_~p1~0#1); {2241#true} is VALID [2022-02-21 00:02:26,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {2241#true} assume !(0 != main_~p2~0#1); {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:26,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p3~0#1); {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:26,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:26,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:26,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:26,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:26,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:26,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:26,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:26,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p11~0#1); {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:26,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:26,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:26,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:26,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p1~0#1); {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:26,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {2243#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p2~0#1; {2242#false} is VALID [2022-02-21 00:02:26,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {2242#false} assume 1 != main_~lk2~0#1; {2242#false} is VALID [2022-02-21 00:02:26,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {2242#false} assume !false; {2242#false} is VALID [2022-02-21 00:02:26,537 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,537 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:26,537 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10252807] [2022-02-21 00:02:26,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10252807] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:26,538 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:26,538 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:26,538 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881397917] [2022-02-21 00:02:26,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:26,539 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:26,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:26,539 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:26,554 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:26,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:26,555 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:26,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:26,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:26,556 INFO L87 Difference]: Start difference. First operand 125 states and 229 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:26,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,650 INFO L93 Difference]: Finished difference Result 181 states and 328 transitions. [2022-02-21 00:02:26,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:26,651 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:26,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:26,651 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:26,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2022-02-21 00:02:26,653 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:26,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2022-02-21 00:02:26,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 171 transitions. [2022-02-21 00:02:26,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:26,774 INFO L225 Difference]: With dead ends: 181 [2022-02-21 00:02:26,775 INFO L226 Difference]: Without dead ends: 181 [2022-02-21 00:02:26,775 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,776 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 67 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 200 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,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 200 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,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-02-21 00:02:26,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2022-02-21 00:02:26,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:26,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 179 states, 178 states have (on average 1.8370786516853932) internal successors, (327), 178 states have internal predecessors, (327), 0 states have call successors, (0), 0 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,783 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 179 states, 178 states have (on average 1.8370786516853932) internal successors, (327), 178 states have internal predecessors, (327), 0 states have call successors, (0), 0 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,783 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 179 states, 178 states have (on average 1.8370786516853932) internal successors, (327), 178 states have internal predecessors, (327), 0 states have call successors, (0), 0 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,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,788 INFO L93 Difference]: Finished difference Result 181 states and 328 transitions. [2022-02-21 00:02:26,788 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 328 transitions. [2022-02-21 00:02:26,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:26,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:26,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 179 states, 178 states have (on average 1.8370786516853932) internal successors, (327), 178 states have internal predecessors, (327), 0 states have call successors, (0), 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 181 states. [2022-02-21 00:02:26,790 INFO L87 Difference]: Start difference. First operand has 179 states, 178 states have (on average 1.8370786516853932) internal successors, (327), 178 states have internal predecessors, (327), 0 states have call successors, (0), 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 181 states. [2022-02-21 00:02:26,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,795 INFO L93 Difference]: Finished difference Result 181 states and 328 transitions. [2022-02-21 00:02:26,795 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 328 transitions. [2022-02-21 00:02:26,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:26,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:26,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:26,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:26,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.8370786516853932) internal successors, (327), 178 states have internal predecessors, (327), 0 states have call successors, (0), 0 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,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 327 transitions. [2022-02-21 00:02:26,801 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 327 transitions. Word has length 22 [2022-02-21 00:02:26,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:26,802 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 327 transitions. [2022-02-21 00:02:26,802 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:26,802 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 327 transitions. [2022-02-21 00:02:26,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-21 00:02:26,803 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:26,803 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:26,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-21 00:02:26,803 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:26,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:26,804 INFO L85 PathProgramCache]: Analyzing trace with hash 127218090, now seen corresponding path program 1 times [2022-02-21 00:02:26,804 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:26,804 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195447945] [2022-02-21 00:02:26,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:26,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:26,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {2968#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(18, 2);call #Ultimate.allocInit(12, 3); {2968#true} is VALID [2022-02-21 00:02:26,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {2968#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_#t~nondet18#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_~p14~0#1, main_~lk14~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;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {2968#true} is VALID [2022-02-21 00:02:26,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {2968#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {2968#true} is VALID [2022-02-21 00:02:26,858 INFO L290 TraceCheckUtils]: 3: Hoare triple {2968#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;main_~lk14~0#1 := 0; {2968#true} is VALID [2022-02-21 00:02:26,858 INFO L290 TraceCheckUtils]: 4: Hoare triple {2968#true} assume !(0 != main_~p1~0#1); {2968#true} is VALID [2022-02-21 00:02:26,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {2968#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p3~0#1); {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p11~0#1); {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p1~0#1); {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:26,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {2970#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p2~0#1); {2969#false} is VALID [2022-02-21 00:02:26,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {2969#false} assume 0 != main_~p3~0#1; {2969#false} is VALID [2022-02-21 00:02:26,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {2969#false} assume 1 != main_~lk3~0#1; {2969#false} is VALID [2022-02-21 00:02:26,864 INFO L290 TraceCheckUtils]: 22: Hoare triple {2969#false} assume !false; {2969#false} is VALID [2022-02-21 00:02:26,865 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,865 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:26,865 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195447945] [2022-02-21 00:02:26,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195447945] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:26,865 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:26,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:26,866 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45418175] [2022-02-21 00:02:26,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:26,866 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:26,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:26,866 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:26,881 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:26,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:26,882 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:26,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:26,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:26,883 INFO L87 Difference]: Start difference. First operand 179 states and 327 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:26,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,989 INFO L93 Difference]: Finished difference Result 183 states and 328 transitions. [2022-02-21 00:02:26,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:26,989 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:26,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:26,989 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:26,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2022-02-21 00:02:26,991 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:26,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2022-02-21 00:02:26,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 170 transitions. [2022-02-21 00:02:27,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:27,101 INFO L225 Difference]: With dead ends: 183 [2022-02-21 00:02:27,101 INFO L226 Difference]: Without dead ends: 183 [2022-02-21 00:02:27,102 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,102 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 69 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 220 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,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 220 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,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-02-21 00:02:27,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2022-02-21 00:02:27,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:27,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 181 states, 180 states have (on average 1.8166666666666667) internal successors, (327), 180 states have internal predecessors, (327), 0 states have call successors, (0), 0 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,108 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 181 states, 180 states have (on average 1.8166666666666667) internal successors, (327), 180 states have internal predecessors, (327), 0 states have call successors, (0), 0 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,109 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 181 states, 180 states have (on average 1.8166666666666667) internal successors, (327), 180 states have internal predecessors, (327), 0 states have call successors, (0), 0 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,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:27,112 INFO L93 Difference]: Finished difference Result 183 states and 328 transitions. [2022-02-21 00:02:27,113 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 328 transitions. [2022-02-21 00:02:27,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:27,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:27,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 180 states have (on average 1.8166666666666667) internal successors, (327), 180 states have internal predecessors, (327), 0 states have call successors, (0), 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 183 states. [2022-02-21 00:02:27,114 INFO L87 Difference]: Start difference. First operand has 181 states, 180 states have (on average 1.8166666666666667) internal successors, (327), 180 states have internal predecessors, (327), 0 states have call successors, (0), 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 183 states. [2022-02-21 00:02:27,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:27,118 INFO L93 Difference]: Finished difference Result 183 states and 328 transitions. [2022-02-21 00:02:27,118 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 328 transitions. [2022-02-21 00:02:27,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:27,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:27,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:27,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:27,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.8166666666666667) internal successors, (327), 180 states have internal predecessors, (327), 0 states have call successors, (0), 0 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,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 327 transitions. [2022-02-21 00:02:27,123 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 327 transitions. Word has length 23 [2022-02-21 00:02:27,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:27,123 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 327 transitions. [2022-02-21 00:02:27,124 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:27,124 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 327 transitions. [2022-02-21 00:02:27,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-21 00:02:27,125 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:27,125 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:27,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-21 00:02:27,125 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:27,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:27,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1866926616, now seen corresponding path program 1 times [2022-02-21 00:02:27,126 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:27,126 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575924958] [2022-02-21 00:02:27,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:27,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:27,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {3703#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(18, 2);call #Ultimate.allocInit(12, 3); {3703#true} is VALID [2022-02-21 00:02:27,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {3703#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_#t~nondet18#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_~p14~0#1, main_~lk14~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;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {3703#true} is VALID [2022-02-21 00:02:27,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {3703#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {3703#true} is VALID [2022-02-21 00:02:27,182 INFO L290 TraceCheckUtils]: 3: Hoare triple {3703#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;main_~lk14~0#1 := 0; {3703#true} is VALID [2022-02-21 00:02:27,182 INFO L290 TraceCheckUtils]: 4: Hoare triple {3703#true} assume !(0 != main_~p1~0#1); {3703#true} is VALID [2022-02-21 00:02:27,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {3703#true} assume !(0 != main_~p2~0#1); {3703#true} is VALID [2022-02-21 00:02:27,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {3703#true} assume !(0 != main_~p3~0#1); {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:27,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:27,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:27,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:27,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:27,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:27,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:27,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:27,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p11~0#1); {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:27,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:27,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:27,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:27,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p1~0#1); {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:27,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p2~0#1); {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:27,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {3705#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p3~0#1; {3704#false} is VALID [2022-02-21 00:02:27,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {3704#false} assume 1 != main_~lk3~0#1; {3704#false} is VALID [2022-02-21 00:02:27,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {3704#false} assume !false; {3704#false} is VALID [2022-02-21 00:02:27,191 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,191 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:27,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575924958] [2022-02-21 00:02:27,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575924958] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:27,191 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:27,192 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:27,192 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477889461] [2022-02-21 00:02:27,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:27,192 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:27,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:27,193 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:27,208 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:27,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:27,209 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:27,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:27,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:27,210 INFO L87 Difference]: Start difference. First operand 181 states and 327 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:27,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:27,302 INFO L93 Difference]: Finished difference Result 351 states and 628 transitions. [2022-02-21 00:02:27,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:27,302 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:27,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:27,303 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:27,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2022-02-21 00:02:27,305 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:27,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2022-02-21 00:02:27,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 170 transitions. [2022-02-21 00:02:27,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:27,417 INFO L225 Difference]: With dead ends: 351 [2022-02-21 00:02:27,418 INFO L226 Difference]: Without dead ends: 351 [2022-02-21 00:02:27,418 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,418 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 67 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 175 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:27,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 175 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:27,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-02-21 00:02:27,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2022-02-21 00:02:27,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:27,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 351 states. Second operand has 349 states, 348 states have (on average 1.8017241379310345) internal successors, (627), 348 states have internal predecessors, (627), 0 states have call successors, (0), 0 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,428 INFO L74 IsIncluded]: Start isIncluded. First operand 351 states. Second operand has 349 states, 348 states have (on average 1.8017241379310345) internal successors, (627), 348 states have internal predecessors, (627), 0 states have call successors, (0), 0 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,429 INFO L87 Difference]: Start difference. First operand 351 states. Second operand has 349 states, 348 states have (on average 1.8017241379310345) internal successors, (627), 348 states have internal predecessors, (627), 0 states have call successors, (0), 0 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,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:27,438 INFO L93 Difference]: Finished difference Result 351 states and 628 transitions. [2022-02-21 00:02:27,438 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 628 transitions. [2022-02-21 00:02:27,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:27,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:27,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 349 states, 348 states have (on average 1.8017241379310345) internal successors, (627), 348 states have internal predecessors, (627), 0 states have call successors, (0), 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 351 states. [2022-02-21 00:02:27,440 INFO L87 Difference]: Start difference. First operand has 349 states, 348 states have (on average 1.8017241379310345) internal successors, (627), 348 states have internal predecessors, (627), 0 states have call successors, (0), 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 351 states. [2022-02-21 00:02:27,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:27,450 INFO L93 Difference]: Finished difference Result 351 states and 628 transitions. [2022-02-21 00:02:27,450 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 628 transitions. [2022-02-21 00:02:27,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:27,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:27,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:27,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:27,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.8017241379310345) internal successors, (627), 348 states have internal predecessors, (627), 0 states have call successors, (0), 0 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,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 627 transitions. [2022-02-21 00:02:27,461 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 627 transitions. Word has length 23 [2022-02-21 00:02:27,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:27,462 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 627 transitions. [2022-02-21 00:02:27,462 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:27,462 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 627 transitions. [2022-02-21 00:02:27,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-21 00:02:27,463 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:27,463 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:27,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-21 00:02:27,463 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:27,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:27,464 INFO L85 PathProgramCache]: Analyzing trace with hash -278578714, now seen corresponding path program 1 times [2022-02-21 00:02:27,464 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:27,464 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675680824] [2022-02-21 00:02:27,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:27,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:27,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {5110#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(18, 2);call #Ultimate.allocInit(12, 3); {5110#true} is VALID [2022-02-21 00:02:27,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {5110#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_#t~nondet18#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_~p14~0#1, main_~lk14~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;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {5110#true} is VALID [2022-02-21 00:02:27,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {5110#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {5110#true} is VALID [2022-02-21 00:02:27,499 INFO L290 TraceCheckUtils]: 3: Hoare triple {5110#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;main_~lk14~0#1 := 0; {5110#true} is VALID [2022-02-21 00:02:27,499 INFO L290 TraceCheckUtils]: 4: Hoare triple {5110#true} assume !(0 != main_~p1~0#1); {5110#true} is VALID [2022-02-21 00:02:27,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {5110#true} assume !(0 != main_~p2~0#1); {5110#true} is VALID [2022-02-21 00:02:27,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {5110#true} assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:27,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:27,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:27,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:27,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:27,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:27,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:27,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:27,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p11~0#1); {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:27,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:27,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:27,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:27,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p1~0#1); {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:27,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p2~0#1); {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:27,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p3~0#1; {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:27,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {5112#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 1 != main_~lk3~0#1; {5111#false} is VALID [2022-02-21 00:02:27,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {5111#false} assume !false; {5111#false} is VALID [2022-02-21 00:02:27,506 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,506 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:27,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675680824] [2022-02-21 00:02:27,507 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675680824] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:27,507 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:27,507 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:27,507 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188757560] [2022-02-21 00:02:27,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:27,508 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:27,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:27,508 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:27,523 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:27,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:27,524 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:27,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:27,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:27,524 INFO L87 Difference]: Start difference. First operand 349 states and 627 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:27,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:27,651 INFO L93 Difference]: Finished difference Result 447 states and 808 transitions. [2022-02-21 00:02:27,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:27,651 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:27,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:27,652 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:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2022-02-21 00:02:27,653 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:27,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2022-02-21 00:02:27,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 163 transitions. [2022-02-21 00:02:27,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:27,788 INFO L225 Difference]: With dead ends: 447 [2022-02-21 00:02:27,788 INFO L226 Difference]: Without dead ends: 447 [2022-02-21 00:02:27,788 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,789 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 62 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 242 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:27,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 242 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:27,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-02-21 00:02:27,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 349. [2022-02-21 00:02:27,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:27,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 447 states. Second operand has 349 states, 348 states have (on average 1.7902298850574712) internal successors, (623), 348 states have internal predecessors, (623), 0 states have call successors, (0), 0 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,798 INFO L74 IsIncluded]: Start isIncluded. First operand 447 states. Second operand has 349 states, 348 states have (on average 1.7902298850574712) internal successors, (623), 348 states have internal predecessors, (623), 0 states have call successors, (0), 0 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,799 INFO L87 Difference]: Start difference. First operand 447 states. Second operand has 349 states, 348 states have (on average 1.7902298850574712) internal successors, (623), 348 states have internal predecessors, (623), 0 states have call successors, (0), 0 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,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:27,812 INFO L93 Difference]: Finished difference Result 447 states and 808 transitions. [2022-02-21 00:02:27,812 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 808 transitions. [2022-02-21 00:02:27,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:27,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:27,814 INFO L74 IsIncluded]: Start isIncluded. First operand has 349 states, 348 states have (on average 1.7902298850574712) internal successors, (623), 348 states have internal predecessors, (623), 0 states have call successors, (0), 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 447 states. [2022-02-21 00:02:27,815 INFO L87 Difference]: Start difference. First operand has 349 states, 348 states have (on average 1.7902298850574712) internal successors, (623), 348 states have internal predecessors, (623), 0 states have call successors, (0), 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 447 states. [2022-02-21 00:02:27,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:27,828 INFO L93 Difference]: Finished difference Result 447 states and 808 transitions. [2022-02-21 00:02:27,828 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 808 transitions. [2022-02-21 00:02:27,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:27,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:27,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:27,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:27,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.7902298850574712) internal successors, (623), 348 states have internal predecessors, (623), 0 states have call successors, (0), 0 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,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 623 transitions. [2022-02-21 00:02:27,839 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 623 transitions. Word has length 23 [2022-02-21 00:02:27,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:27,839 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 623 transitions. [2022-02-21 00:02:27,840 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:27,840 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 623 transitions. [2022-02-21 00:02:27,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-21 00:02:27,840 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:27,841 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:27,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-21 00:02:27,841 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:27,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:27,842 INFO L85 PathProgramCache]: Analyzing trace with hash -2039937514, now seen corresponding path program 1 times [2022-02-21 00:02:27,842 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:27,842 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120580680] [2022-02-21 00:02:27,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:27,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:27,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {6805#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(18, 2);call #Ultimate.allocInit(12, 3); {6805#true} is VALID [2022-02-21 00:02:27,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {6805#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_#t~nondet18#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_~p14~0#1, main_~lk14~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;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {6805#true} is VALID [2022-02-21 00:02:27,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {6805#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {6805#true} is VALID [2022-02-21 00:02:27,880 INFO L290 TraceCheckUtils]: 3: Hoare triple {6805#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;main_~lk14~0#1 := 0; {6805#true} is VALID [2022-02-21 00:02:27,881 INFO L290 TraceCheckUtils]: 4: Hoare triple {6805#true} assume !(0 != main_~p1~0#1); {6805#true} is VALID [2022-02-21 00:02:27,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {6805#true} assume !(0 != main_~p2~0#1); {6805#true} is VALID [2022-02-21 00:02:27,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {6805#true} assume !(0 != main_~p3~0#1); {6805#true} is VALID [2022-02-21 00:02:27,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {6805#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:27,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:27,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:27,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:27,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:27,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:27,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:27,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p11~0#1); {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:27,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:27,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:27,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:27,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p1~0#1); {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:27,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p2~0#1); {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:27,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p3~0#1); {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:27,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p4~0#1; {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:27,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {6807#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 1 != main_~lk4~0#1; {6806#false} is VALID [2022-02-21 00:02:27,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {6806#false} assume !false; {6806#false} is VALID [2022-02-21 00:02:27,888 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,888 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:27,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120580680] [2022-02-21 00:02:27,888 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120580680] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:27,888 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:27,888 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:27,889 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801696417] [2022-02-21 00:02:27,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:27,889 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:27,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:27,890 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:27,906 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:27,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:27,906 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:27,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:27,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:27,907 INFO L87 Difference]: Start difference. First operand 349 states and 623 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:28,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:28,011 INFO L93 Difference]: Finished difference Result 659 states and 1184 transitions. [2022-02-21 00:02:28,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:28,011 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:28,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:28,011 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:28,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2022-02-21 00:02:28,013 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:28,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2022-02-21 00:02:28,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 162 transitions. [2022-02-21 00:02:28,131 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:28,153 INFO L225 Difference]: With dead ends: 659 [2022-02-21 00:02:28,154 INFO L226 Difference]: Without dead ends: 659 [2022-02-21 00:02:28,154 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,155 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 59 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 169 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:28,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 169 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:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2022-02-21 00:02:28,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 481. [2022-02-21 00:02:28,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:28,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 659 states. Second operand has 481 states, 480 states have (on average 1.7645833333333334) internal successors, (847), 480 states have internal predecessors, (847), 0 states have call successors, (0), 0 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,166 INFO L74 IsIncluded]: Start isIncluded. First operand 659 states. Second operand has 481 states, 480 states have (on average 1.7645833333333334) internal successors, (847), 480 states have internal predecessors, (847), 0 states have call successors, (0), 0 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,167 INFO L87 Difference]: Start difference. First operand 659 states. Second operand has 481 states, 480 states have (on average 1.7645833333333334) internal successors, (847), 480 states have internal predecessors, (847), 0 states have call successors, (0), 0 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 L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:28,190 INFO L93 Difference]: Finished difference Result 659 states and 1184 transitions. [2022-02-21 00:02:28,190 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1184 transitions. [2022-02-21 00:02:28,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:28,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:28,193 INFO L74 IsIncluded]: Start isIncluded. First operand has 481 states, 480 states have (on average 1.7645833333333334) internal successors, (847), 480 states have internal predecessors, (847), 0 states have call successors, (0), 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 659 states. [2022-02-21 00:02:28,194 INFO L87 Difference]: Start difference. First operand has 481 states, 480 states have (on average 1.7645833333333334) internal successors, (847), 480 states have internal predecessors, (847), 0 states have call successors, (0), 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 659 states. [2022-02-21 00:02:28,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:28,217 INFO L93 Difference]: Finished difference Result 659 states and 1184 transitions. [2022-02-21 00:02:28,217 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1184 transitions. [2022-02-21 00:02:28,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:28,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:28,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:28,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:28,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.7645833333333334) internal successors, (847), 480 states have internal predecessors, (847), 0 states have call successors, (0), 0 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,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 847 transitions. [2022-02-21 00:02:28,234 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 847 transitions. Word has length 24 [2022-02-21 00:02:28,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:28,234 INFO L470 AbstractCegarLoop]: Abstraction has 481 states and 847 transitions. [2022-02-21 00:02:28,235 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:28,235 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 847 transitions. [2022-02-21 00:02:28,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-21 00:02:28,236 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:28,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] [2022-02-21 00:02:28,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-21 00:02:28,236 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:28,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:28,237 INFO L85 PathProgramCache]: Analyzing trace with hash 666681880, now seen corresponding path program 1 times [2022-02-21 00:02:28,237 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:28,237 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332746846] [2022-02-21 00:02:28,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:28,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:28,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {9268#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(18, 2);call #Ultimate.allocInit(12, 3); {9268#true} is VALID [2022-02-21 00:02:28,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {9268#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_#t~nondet18#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_~p14~0#1, main_~lk14~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;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {9268#true} is VALID [2022-02-21 00:02:28,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {9268#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {9268#true} is VALID [2022-02-21 00:02:28,266 INFO L290 TraceCheckUtils]: 3: Hoare triple {9268#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;main_~lk14~0#1 := 0; {9268#true} is VALID [2022-02-21 00:02:28,267 INFO L290 TraceCheckUtils]: 4: Hoare triple {9268#true} assume !(0 != main_~p1~0#1); {9268#true} is VALID [2022-02-21 00:02:28,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {9268#true} assume !(0 != main_~p2~0#1); {9268#true} is VALID [2022-02-21 00:02:28,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {9268#true} assume !(0 != main_~p3~0#1); {9268#true} is VALID [2022-02-21 00:02:28,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {9268#true} assume !(0 != main_~p4~0#1); {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:28,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:28,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:28,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:28,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:28,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:28,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:28,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p11~0#1); {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:28,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:28,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:28,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:28,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p1~0#1); {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:28,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p2~0#1); {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:28,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p3~0#1); {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:28,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {9270#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p4~0#1; {9269#false} is VALID [2022-02-21 00:02:28,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {9269#false} assume 1 != main_~lk4~0#1; {9269#false} is VALID [2022-02-21 00:02:28,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {9269#false} assume !false; {9269#false} is VALID [2022-02-21 00:02:28,273 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,273 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:28,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332746846] [2022-02-21 00:02:28,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332746846] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:28,274 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:28,274 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:28,274 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158651132] [2022-02-21 00:02:28,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:28,275 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:28,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:28,275 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:28,292 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:28,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:28,293 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:28,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:28,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:28,293 INFO L87 Difference]: Start difference. First operand 481 states and 847 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:28,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:28,407 INFO L93 Difference]: Finished difference Result 683 states and 1196 transitions. [2022-02-21 00:02:28,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:28,407 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:28,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:28,408 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:28,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2022-02-21 00:02:28,410 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:28,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2022-02-21 00:02:28,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 167 transitions. [2022-02-21 00:02:28,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:28,569 INFO L225 Difference]: With dead ends: 683 [2022-02-21 00:02:28,569 INFO L226 Difference]: Without dead ends: 683 [2022-02-21 00:02:28,570 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,570 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 65 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 202 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,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 202 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,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-02-21 00:02:28,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 681. [2022-02-21 00:02:28,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:28,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 683 states. Second operand has 681 states, 680 states have (on average 1.7573529411764706) internal successors, (1195), 680 states have internal predecessors, (1195), 0 states have call successors, (0), 0 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,587 INFO L74 IsIncluded]: Start isIncluded. First operand 683 states. Second operand has 681 states, 680 states have (on average 1.7573529411764706) internal successors, (1195), 680 states have internal predecessors, (1195), 0 states have call successors, (0), 0 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,588 INFO L87 Difference]: Start difference. First operand 683 states. Second operand has 681 states, 680 states have (on average 1.7573529411764706) internal successors, (1195), 680 states have internal predecessors, (1195), 0 states have call successors, (0), 0 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,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:28,612 INFO L93 Difference]: Finished difference Result 683 states and 1196 transitions. [2022-02-21 00:02:28,612 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1196 transitions. [2022-02-21 00:02:28,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:28,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:28,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 681 states, 680 states have (on average 1.7573529411764706) internal successors, (1195), 680 states have internal predecessors, (1195), 0 states have call successors, (0), 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 683 states. [2022-02-21 00:02:28,617 INFO L87 Difference]: Start difference. First operand has 681 states, 680 states have (on average 1.7573529411764706) internal successors, (1195), 680 states have internal predecessors, (1195), 0 states have call successors, (0), 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 683 states. [2022-02-21 00:02:28,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:28,642 INFO L93 Difference]: Finished difference Result 683 states and 1196 transitions. [2022-02-21 00:02:28,642 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1196 transitions. [2022-02-21 00:02:28,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:28,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:28,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:28,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:28,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 680 states have (on average 1.7573529411764706) internal successors, (1195), 680 states have internal predecessors, (1195), 0 states have call successors, (0), 0 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,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1195 transitions. [2022-02-21 00:02:28,670 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1195 transitions. Word has length 24 [2022-02-21 00:02:28,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:28,670 INFO L470 AbstractCegarLoop]: Abstraction has 681 states and 1195 transitions. [2022-02-21 00:02:28,670 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:28,670 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1195 transitions. [2022-02-21 00:02:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-21 00:02:28,672 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:28,672 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,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-21 00:02:28,672 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:28,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:28,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1186659581, now seen corresponding path program 1 times [2022-02-21 00:02:28,673 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:28,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131479604] [2022-02-21 00:02:28,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:28,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:28,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {12003#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(18, 2);call #Ultimate.allocInit(12, 3); {12003#true} is VALID [2022-02-21 00:02:28,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {12003#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_#t~nondet18#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_~p14~0#1, main_~lk14~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;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {12003#true} is VALID [2022-02-21 00:02:28,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {12003#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {12003#true} is VALID [2022-02-21 00:02:28,733 INFO L290 TraceCheckUtils]: 3: Hoare triple {12003#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;main_~lk14~0#1 := 0; {12003#true} is VALID [2022-02-21 00:02:28,734 INFO L290 TraceCheckUtils]: 4: Hoare triple {12003#true} assume !(0 != main_~p1~0#1); {12003#true} is VALID [2022-02-21 00:02:28,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {12003#true} assume !(0 != main_~p2~0#1); {12003#true} is VALID [2022-02-21 00:02:28,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {12003#true} assume !(0 != main_~p3~0#1); {12003#true} is VALID [2022-02-21 00:02:28,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {12003#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:28,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:28,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:28,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:28,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:28,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:28,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:28,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p11~0#1); {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:28,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:28,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:28,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:28,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p1~0#1); {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:28,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p2~0#1); {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:28,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p3~0#1); {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:28,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {12005#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p4~0#1); {12004#false} is VALID [2022-02-21 00:02:28,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {12004#false} assume 0 != main_~p5~0#1; {12004#false} is VALID [2022-02-21 00:02:28,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {12004#false} assume 1 != main_~lk5~0#1; {12004#false} is VALID [2022-02-21 00:02:28,748 INFO L290 TraceCheckUtils]: 24: Hoare triple {12004#false} assume !false; {12004#false} is VALID [2022-02-21 00:02:28,749 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,749 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:28,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131479604] [2022-02-21 00:02:28,749 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131479604] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:28,749 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:28,749 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:28,750 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703752847] [2022-02-21 00:02:28,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:28,753 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,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:28,753 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,772 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,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:28,773 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:28,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:28,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:28,774 INFO L87 Difference]: Start difference. First operand 681 states and 1195 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,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:28,897 INFO L93 Difference]: Finished difference Result 695 states and 1204 transitions. [2022-02-21 00:02:28,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:28,897 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,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:28,897 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,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2022-02-21 00:02:28,899 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,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2022-02-21 00:02:28,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 166 transitions. [2022-02-21 00:02:29,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:29,033 INFO L225 Difference]: With dead ends: 695 [2022-02-21 00:02:29,034 INFO L226 Difference]: Without dead ends: 695 [2022-02-21 00:02:29,034 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,034 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 67 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 212 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,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 212 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,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-02-21 00:02:29,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 693. [2022-02-21 00:02:29,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:29,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 695 states. Second operand has 693 states, 692 states have (on average 1.7384393063583814) internal successors, (1203), 692 states have internal predecessors, (1203), 0 states have call successors, (0), 0 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,060 INFO L74 IsIncluded]: Start isIncluded. First operand 695 states. Second operand has 693 states, 692 states have (on average 1.7384393063583814) internal successors, (1203), 692 states have internal predecessors, (1203), 0 states have call successors, (0), 0 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,061 INFO L87 Difference]: Start difference. First operand 695 states. Second operand has 693 states, 692 states have (on average 1.7384393063583814) internal successors, (1203), 692 states have internal predecessors, (1203), 0 states have call successors, (0), 0 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,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:29,085 INFO L93 Difference]: Finished difference Result 695 states and 1204 transitions. [2022-02-21 00:02:29,085 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1204 transitions. [2022-02-21 00:02:29,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:29,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:29,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 693 states, 692 states have (on average 1.7384393063583814) internal successors, (1203), 692 states have internal predecessors, (1203), 0 states have call successors, (0), 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 695 states. [2022-02-21 00:02:29,089 INFO L87 Difference]: Start difference. First operand has 693 states, 692 states have (on average 1.7384393063583814) internal successors, (1203), 692 states have internal predecessors, (1203), 0 states have call successors, (0), 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 695 states. [2022-02-21 00:02:29,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:29,112 INFO L93 Difference]: Finished difference Result 695 states and 1204 transitions. [2022-02-21 00:02:29,112 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1204 transitions. [2022-02-21 00:02:29,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:29,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:29,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:29,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:29,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 1.7384393063583814) internal successors, (1203), 692 states have internal predecessors, (1203), 0 states have call successors, (0), 0 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,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1203 transitions. [2022-02-21 00:02:29,138 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1203 transitions. Word has length 25 [2022-02-21 00:02:29,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:29,138 INFO L470 AbstractCegarLoop]: Abstraction has 693 states and 1203 transitions. [2022-02-21 00:02:29,139 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,139 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1203 transitions. [2022-02-21 00:02:29,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-21 00:02:29,140 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:29,140 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:29,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-21 00:02:29,140 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:29,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:29,141 INFO L85 PathProgramCache]: Analyzing trace with hash -807485125, now seen corresponding path program 1 times [2022-02-21 00:02:29,141 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:29,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497440162] [2022-02-21 00:02:29,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:29,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:29,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {14786#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(18, 2);call #Ultimate.allocInit(12, 3); {14786#true} is VALID [2022-02-21 00:02:29,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {14786#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_#t~nondet18#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_~p14~0#1, main_~lk14~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;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {14786#true} is VALID [2022-02-21 00:02:29,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {14786#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {14786#true} is VALID [2022-02-21 00:02:29,167 INFO L290 TraceCheckUtils]: 3: Hoare triple {14786#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;main_~lk14~0#1 := 0; {14786#true} is VALID [2022-02-21 00:02:29,167 INFO L290 TraceCheckUtils]: 4: Hoare triple {14786#true} assume !(0 != main_~p1~0#1); {14786#true} is VALID [2022-02-21 00:02:29,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {14786#true} assume !(0 != main_~p2~0#1); {14786#true} is VALID [2022-02-21 00:02:29,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {14786#true} assume !(0 != main_~p3~0#1); {14786#true} is VALID [2022-02-21 00:02:29,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {14786#true} assume !(0 != main_~p4~0#1); {14786#true} is VALID [2022-02-21 00:02:29,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {14786#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:29,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:29,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:29,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:29,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:29,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:29,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p11~0#1); {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:29,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:29,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:29,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:29,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p1~0#1); {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:29,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p2~0#1); {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:29,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p3~0#1); {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:29,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p4~0#1); {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:29,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p5~0#1; {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:29,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {14788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 1 != main_~lk5~0#1; {14787#false} is VALID [2022-02-21 00:02:29,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {14787#false} assume !false; {14787#false} is VALID [2022-02-21 00:02:29,174 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,174 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:29,175 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497440162] [2022-02-21 00:02:29,175 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497440162] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:29,175 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:29,175 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:29,175 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207894899] [2022-02-21 00:02:29,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:29,176 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:29,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:29,176 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:29,192 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:29,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:29,193 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:29,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:29,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:29,193 INFO L87 Difference]: Start difference. First operand 693 states and 1203 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:29,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:29,342 INFO L93 Difference]: Finished difference Result 1287 states and 2252 transitions. [2022-02-21 00:02:29,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:29,343 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:29,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:29,343 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:29,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2022-02-21 00:02:29,345 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:29,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2022-02-21 00:02:29,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 158 transitions. [2022-02-21 00:02:29,448 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:29,525 INFO L225 Difference]: With dead ends: 1287 [2022-02-21 00:02:29,526 INFO L226 Difference]: Without dead ends: 1287 [2022-02-21 00:02:29,526 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,527 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 56 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 167 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:29,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 167 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:29,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2022-02-21 00:02:29,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 965. [2022-02-21 00:02:29,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:29,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1287 states. Second operand has 965 states, 964 states have (on average 1.704356846473029) internal successors, (1643), 964 states have internal predecessors, (1643), 0 states have call successors, (0), 0 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,547 INFO L74 IsIncluded]: Start isIncluded. First operand 1287 states. Second operand has 965 states, 964 states have (on average 1.704356846473029) internal successors, (1643), 964 states have internal predecessors, (1643), 0 states have call successors, (0), 0 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,548 INFO L87 Difference]: Start difference. First operand 1287 states. Second operand has 965 states, 964 states have (on average 1.704356846473029) internal successors, (1643), 964 states have internal predecessors, (1643), 0 states have call successors, (0), 0 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,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:29,619 INFO L93 Difference]: Finished difference Result 1287 states and 2252 transitions. [2022-02-21 00:02:29,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 2252 transitions. [2022-02-21 00:02:29,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:29,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:29,624 INFO L74 IsIncluded]: Start isIncluded. First operand has 965 states, 964 states have (on average 1.704356846473029) internal successors, (1643), 964 states have internal predecessors, (1643), 0 states have call successors, (0), 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 1287 states. [2022-02-21 00:02:29,626 INFO L87 Difference]: Start difference. First operand has 965 states, 964 states have (on average 1.704356846473029) internal successors, (1643), 964 states have internal predecessors, (1643), 0 states have call successors, (0), 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 1287 states. [2022-02-21 00:02:29,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:29,708 INFO L93 Difference]: Finished difference Result 1287 states and 2252 transitions. [2022-02-21 00:02:29,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 2252 transitions. [2022-02-21 00:02:29,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:29,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:29,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:29,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:29,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 1.704356846473029) internal successors, (1643), 964 states have internal predecessors, (1643), 0 states have call successors, (0), 0 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,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1643 transitions. [2022-02-21 00:02:29,756 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1643 transitions. Word has length 25 [2022-02-21 00:02:29,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:29,756 INFO L470 AbstractCegarLoop]: Abstraction has 965 states and 1643 transitions. [2022-02-21 00:02:29,757 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,757 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1643 transitions. [2022-02-21 00:02:29,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-21 00:02:29,758 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:29,758 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:29,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-21 00:02:29,759 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:29,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:29,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1899134269, now seen corresponding path program 1 times [2022-02-21 00:02:29,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:29,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508366030] [2022-02-21 00:02:29,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:29,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:29,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {19617#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(18, 2);call #Ultimate.allocInit(12, 3); {19617#true} is VALID [2022-02-21 00:02:29,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {19617#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_#t~nondet18#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_~p14~0#1, main_~lk14~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;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {19617#true} is VALID [2022-02-21 00:02:29,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {19617#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {19617#true} is VALID [2022-02-21 00:02:29,793 INFO L290 TraceCheckUtils]: 3: Hoare triple {19617#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;main_~lk14~0#1 := 0; {19617#true} is VALID [2022-02-21 00:02:29,793 INFO L290 TraceCheckUtils]: 4: Hoare triple {19617#true} assume !(0 != main_~p1~0#1); {19617#true} is VALID [2022-02-21 00:02:29,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {19617#true} assume !(0 != main_~p2~0#1); {19617#true} is VALID [2022-02-21 00:02:29,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {19617#true} assume !(0 != main_~p3~0#1); {19617#true} is VALID [2022-02-21 00:02:29,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {19617#true} assume !(0 != main_~p4~0#1); {19617#true} is VALID [2022-02-21 00:02:29,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {19617#true} assume !(0 != main_~p5~0#1); {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:29,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:29,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:29,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:29,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:29,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:29,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p11~0#1); {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:29,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:29,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:29,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:29,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p1~0#1); {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:29,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p2~0#1); {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:29,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p3~0#1); {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:29,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p4~0#1); {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:29,801 INFO L290 TraceCheckUtils]: 22: Hoare triple {19619#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p5~0#1; {19618#false} is VALID [2022-02-21 00:02:29,801 INFO L290 TraceCheckUtils]: 23: Hoare triple {19618#false} assume 1 != main_~lk5~0#1; {19618#false} is VALID [2022-02-21 00:02:29,801 INFO L290 TraceCheckUtils]: 24: Hoare triple {19618#false} assume !false; {19618#false} is VALID [2022-02-21 00:02:29,801 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,801 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:29,802 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508366030] [2022-02-21 00:02:29,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508366030] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:29,802 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:29,802 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:29,803 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948963233] [2022-02-21 00:02:29,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:29,804 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:29,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:29,804 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:29,820 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:29,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:29,821 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:29,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:29,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:29,821 INFO L87 Difference]: Start difference. First operand 965 states and 1643 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:29,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:29,986 INFO L93 Difference]: Finished difference Result 1351 states and 2292 transitions. [2022-02-21 00:02:29,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:29,986 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:29,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:29,986 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:29,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2022-02-21 00:02:29,988 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:29,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2022-02-21 00:02:29,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 165 transitions. [2022-02-21 00:02:30,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:30,186 INFO L225 Difference]: With dead ends: 1351 [2022-02-21 00:02:30,187 INFO L226 Difference]: Without dead ends: 1351 [2022-02-21 00:02:30,188 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:30,189 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 64 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 203 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:30,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 203 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:30,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-02-21 00:02:30,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1349. [2022-02-21 00:02:30,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:30,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1351 states. Second operand has 1349 states, 1348 states have (on average 1.6995548961424332) internal successors, (2291), 1348 states have internal predecessors, (2291), 0 states have call successors, (0), 0 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,216 INFO L74 IsIncluded]: Start isIncluded. First operand 1351 states. Second operand has 1349 states, 1348 states have (on average 1.6995548961424332) internal successors, (2291), 1348 states have internal predecessors, (2291), 0 states have call successors, (0), 0 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,218 INFO L87 Difference]: Start difference. First operand 1351 states. Second operand has 1349 states, 1348 states have (on average 1.6995548961424332) internal successors, (2291), 1348 states have internal predecessors, (2291), 0 states have call successors, (0), 0 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,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:30,302 INFO L93 Difference]: Finished difference Result 1351 states and 2292 transitions. [2022-02-21 00:02:30,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 2292 transitions. [2022-02-21 00:02:30,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:30,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:30,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 1349 states, 1348 states have (on average 1.6995548961424332) internal successors, (2291), 1348 states have internal predecessors, (2291), 0 states have call successors, (0), 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 1351 states. [2022-02-21 00:02:30,311 INFO L87 Difference]: Start difference. First operand has 1349 states, 1348 states have (on average 1.6995548961424332) internal successors, (2291), 1348 states have internal predecessors, (2291), 0 states have call successors, (0), 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 1351 states. [2022-02-21 00:02:30,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:30,386 INFO L93 Difference]: Finished difference Result 1351 states and 2292 transitions. [2022-02-21 00:02:30,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 2292 transitions. [2022-02-21 00:02:30,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:30,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:30,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:30,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:30,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1348 states have (on average 1.6995548961424332) internal successors, (2291), 1348 states have internal predecessors, (2291), 0 states have call successors, (0), 0 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,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 2291 transitions. [2022-02-21 00:02:30,464 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 2291 transitions. Word has length 25 [2022-02-21 00:02:30,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:30,465 INFO L470 AbstractCegarLoop]: Abstraction has 1349 states and 2291 transitions. [2022-02-21 00:02:30,465 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:30,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 2291 transitions. [2022-02-21 00:02:30,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-21 00:02:30,467 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:30,468 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,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-21 00:02:30,469 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:30,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:30,469 INFO L85 PathProgramCache]: Analyzing trace with hash 737978317, now seen corresponding path program 1 times [2022-02-21 00:02:30,470 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:30,470 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006497375] [2022-02-21 00:02:30,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:30,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:30,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {25024#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(18, 2);call #Ultimate.allocInit(12, 3); {25024#true} is VALID [2022-02-21 00:02:30,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {25024#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_#t~nondet18#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_~p14~0#1, main_~lk14~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;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {25024#true} is VALID [2022-02-21 00:02:30,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {25024#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {25024#true} is VALID [2022-02-21 00:02:30,510 INFO L290 TraceCheckUtils]: 3: Hoare triple {25024#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;main_~lk14~0#1 := 0; {25024#true} is VALID [2022-02-21 00:02:30,511 INFO L290 TraceCheckUtils]: 4: Hoare triple {25024#true} assume !(0 != main_~p1~0#1); {25024#true} is VALID [2022-02-21 00:02:30,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {25024#true} assume !(0 != main_~p2~0#1); {25024#true} is VALID [2022-02-21 00:02:30,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {25024#true} assume !(0 != main_~p3~0#1); {25024#true} is VALID [2022-02-21 00:02:30,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {25024#true} assume !(0 != main_~p4~0#1); {25024#true} is VALID [2022-02-21 00:02:30,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {25024#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:30,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:30,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:30,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:30,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:30,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:30,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p11~0#1); {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:30,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:30,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:30,515 INFO L290 TraceCheckUtils]: 17: Hoare triple {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:30,515 INFO L290 TraceCheckUtils]: 18: Hoare triple {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p1~0#1); {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:30,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p2~0#1); {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:30,516 INFO L290 TraceCheckUtils]: 20: Hoare triple {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p3~0#1); {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:30,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p4~0#1); {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:30,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {25026#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p5~0#1); {25025#false} is VALID [2022-02-21 00:02:30,517 INFO L290 TraceCheckUtils]: 23: Hoare triple {25025#false} assume 0 != main_~p6~0#1; {25025#false} is VALID [2022-02-21 00:02:30,517 INFO L290 TraceCheckUtils]: 24: Hoare triple {25025#false} assume 1 != main_~lk6~0#1; {25025#false} is VALID [2022-02-21 00:02:30,517 INFO L290 TraceCheckUtils]: 25: Hoare triple {25025#false} assume !false; {25025#false} is VALID [2022-02-21 00:02:30,518 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,518 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:30,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006497375] [2022-02-21 00:02:30,520 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006497375] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:30,520 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:30,520 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:30,521 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479887081] [2022-02-21 00:02:30,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:30,521 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,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:30,522 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,538 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,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:30,539 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:30,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:30,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:30,540 INFO L87 Difference]: Start difference. First operand 1349 states and 2291 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,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:30,706 INFO L93 Difference]: Finished difference Result 1367 states and 2292 transitions. [2022-02-21 00:02:30,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:30,707 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,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:30,707 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,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2022-02-21 00:02:30,709 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,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2022-02-21 00:02:30,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 164 transitions. [2022-02-21 00:02:30,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:30,904 INFO L225 Difference]: With dead ends: 1367 [2022-02-21 00:02:30,905 INFO L226 Difference]: Without dead ends: 1367 [2022-02-21 00:02:30,905 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:30,906 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 66 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 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:30,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 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:30,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2022-02-21 00:02:30,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1365. [2022-02-21 00:02:30,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:30,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1367 states. Second operand has 1365 states, 1364 states have (on average 1.6796187683284458) internal successors, (2291), 1364 states have internal predecessors, (2291), 0 states have call successors, (0), 0 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,942 INFO L74 IsIncluded]: Start isIncluded. First operand 1367 states. Second operand has 1365 states, 1364 states have (on average 1.6796187683284458) internal successors, (2291), 1364 states have internal predecessors, (2291), 0 states have call successors, (0), 0 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,944 INFO L87 Difference]: Start difference. First operand 1367 states. Second operand has 1365 states, 1364 states have (on average 1.6796187683284458) internal successors, (2291), 1364 states have internal predecessors, (2291), 0 states have call successors, (0), 0 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,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:31,012 INFO L93 Difference]: Finished difference Result 1367 states and 2292 transitions. [2022-02-21 00:02:31,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 2292 transitions. [2022-02-21 00:02:31,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:31,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:31,018 INFO L74 IsIncluded]: Start isIncluded. First operand has 1365 states, 1364 states have (on average 1.6796187683284458) internal successors, (2291), 1364 states have internal predecessors, (2291), 0 states have call successors, (0), 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 1367 states. [2022-02-21 00:02:31,020 INFO L87 Difference]: Start difference. First operand has 1365 states, 1364 states have (on average 1.6796187683284458) internal successors, (2291), 1364 states have internal predecessors, (2291), 0 states have call successors, (0), 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 1367 states. [2022-02-21 00:02:31,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:31,080 INFO L93 Difference]: Finished difference Result 1367 states and 2292 transitions. [2022-02-21 00:02:31,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 2292 transitions. [2022-02-21 00:02:31,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:31,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:31,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:31,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:31,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1364 states have (on average 1.6796187683284458) internal successors, (2291), 1364 states have internal predecessors, (2291), 0 states have call successors, (0), 0 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,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2291 transitions. [2022-02-21 00:02:31,163 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2291 transitions. Word has length 26 [2022-02-21 00:02:31,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:31,163 INFO L470 AbstractCegarLoop]: Abstraction has 1365 states and 2291 transitions. [2022-02-21 00:02:31,163 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:31,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2291 transitions. [2022-02-21 00:02:31,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-21 00:02:31,165 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:31,165 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:31,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-21 00:02:31,166 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:31,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:31,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1256166389, now seen corresponding path program 1 times [2022-02-21 00:02:31,166 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:31,167 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460866109] [2022-02-21 00:02:31,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:31,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:31,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {30495#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(18, 2);call #Ultimate.allocInit(12, 3); {30495#true} is VALID [2022-02-21 00:02:31,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {30495#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_#t~nondet18#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_~p14~0#1, main_~lk14~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;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {30495#true} is VALID [2022-02-21 00:02:31,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {30495#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {30495#true} is VALID [2022-02-21 00:02:31,193 INFO L290 TraceCheckUtils]: 3: Hoare triple {30495#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;main_~lk14~0#1 := 0; {30495#true} is VALID [2022-02-21 00:02:31,193 INFO L290 TraceCheckUtils]: 4: Hoare triple {30495#true} assume !(0 != main_~p1~0#1); {30495#true} is VALID [2022-02-21 00:02:31,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {30495#true} assume !(0 != main_~p2~0#1); {30495#true} is VALID [2022-02-21 00:02:31,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {30495#true} assume !(0 != main_~p3~0#1); {30495#true} is VALID [2022-02-21 00:02:31,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {30495#true} assume !(0 != main_~p4~0#1); {30495#true} is VALID [2022-02-21 00:02:31,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {30495#true} assume !(0 != main_~p5~0#1); {30495#true} is VALID [2022-02-21 00:02:31,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {30495#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:31,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:31,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:31,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:31,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:31,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p11~0#1); {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:31,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:31,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:31,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:31,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p1~0#1); {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:31,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p2~0#1); {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:31,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p3~0#1); {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:31,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p4~0#1); {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:31,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p5~0#1); {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:31,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p6~0#1; {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:31,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {30497#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 1 != main_~lk6~0#1; {30496#false} is VALID [2022-02-21 00:02:31,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {30496#false} assume !false; {30496#false} is VALID [2022-02-21 00:02:31,206 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:31,206 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:31,206 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460866109] [2022-02-21 00:02:31,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460866109] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:31,207 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:31,207 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:31,207 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584288710] [2022-02-21 00:02:31,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:31,208 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:31,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:31,208 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:31,227 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:31,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:31,227 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:31,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:31,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:31,228 INFO L87 Difference]: Start difference. First operand 1365 states and 2291 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:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:31,561 INFO L93 Difference]: Finished difference Result 2503 states and 4244 transitions. [2022-02-21 00:02:31,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:31,561 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:31,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:31,562 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:31,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2022-02-21 00:02:31,563 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:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2022-02-21 00:02:31,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 154 transitions. [2022-02-21 00:02:31,672 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:31,890 INFO L225 Difference]: With dead ends: 2503 [2022-02-21 00:02:31,890 INFO L226 Difference]: Without dead ends: 2503 [2022-02-21 00:02:31,890 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,891 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 53 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 165 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,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 165 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,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2022-02-21 00:02:31,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 1925. [2022-02-21 00:02:31,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:31,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2503 states. Second operand has 1925 states, 1924 states have (on average 1.6398128898128899) internal successors, (3155), 1924 states have internal predecessors, (3155), 0 states have call successors, (0), 0 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,950 INFO L74 IsIncluded]: Start isIncluded. First operand 2503 states. Second operand has 1925 states, 1924 states have (on average 1.6398128898128899) internal successors, (3155), 1924 states have internal predecessors, (3155), 0 states have call successors, (0), 0 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,953 INFO L87 Difference]: Start difference. First operand 2503 states. Second operand has 1925 states, 1924 states have (on average 1.6398128898128899) internal successors, (3155), 1924 states have internal predecessors, (3155), 0 states have call successors, (0), 0 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,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:32,167 INFO L93 Difference]: Finished difference Result 2503 states and 4244 transitions. [2022-02-21 00:02:32,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 4244 transitions. [2022-02-21 00:02:32,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:32,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:32,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 1925 states, 1924 states have (on average 1.6398128898128899) internal successors, (3155), 1924 states have internal predecessors, (3155), 0 states have call successors, (0), 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:32,176 INFO L87 Difference]: Start difference. First operand has 1925 states, 1924 states have (on average 1.6398128898128899) internal successors, (3155), 1924 states have internal predecessors, (3155), 0 states have call successors, (0), 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:32,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:32,385 INFO L93 Difference]: Finished difference Result 2503 states and 4244 transitions. [2022-02-21 00:02:32,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 4244 transitions. [2022-02-21 00:02:32,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:32,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:32,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:32,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:32,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1924 states have (on average 1.6398128898128899) internal successors, (3155), 1924 states have internal predecessors, (3155), 0 states have call successors, (0), 0 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,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 3155 transitions. [2022-02-21 00:02:32,497 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 3155 transitions. Word has length 26 [2022-02-21 00:02:32,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:32,497 INFO L470 AbstractCegarLoop]: Abstraction has 1925 states and 3155 transitions. [2022-02-21 00:02:32,497 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:32,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 3155 transitions. [2022-02-21 00:02:32,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-21 00:02:32,499 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:32,500 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:32,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-21 00:02:32,500 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:32,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:32,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1450453005, now seen corresponding path program 1 times [2022-02-21 00:02:32,501 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:32,501 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255392922] [2022-02-21 00:02:32,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:32,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:32,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {39934#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(18, 2);call #Ultimate.allocInit(12, 3); {39934#true} is VALID [2022-02-21 00:02:32,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {39934#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_#t~nondet18#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_~p14~0#1, main_~lk14~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;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {39934#true} is VALID [2022-02-21 00:02:32,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {39934#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {39934#true} is VALID [2022-02-21 00:02:32,530 INFO L290 TraceCheckUtils]: 3: Hoare triple {39934#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;main_~lk14~0#1 := 0; {39934#true} is VALID [2022-02-21 00:02:32,531 INFO L290 TraceCheckUtils]: 4: Hoare triple {39934#true} assume !(0 != main_~p1~0#1); {39934#true} is VALID [2022-02-21 00:02:32,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {39934#true} assume !(0 != main_~p2~0#1); {39934#true} is VALID [2022-02-21 00:02:32,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {39934#true} assume !(0 != main_~p3~0#1); {39934#true} is VALID [2022-02-21 00:02:32,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {39934#true} assume !(0 != main_~p4~0#1); {39934#true} is VALID [2022-02-21 00:02:32,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {39934#true} assume !(0 != main_~p5~0#1); {39934#true} is VALID [2022-02-21 00:02:32,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {39934#true} assume !(0 != main_~p6~0#1); {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:32,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:32,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:32,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:32,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:32,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p11~0#1); {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:32,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:32,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:32,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:32,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p1~0#1); {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:32,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p2~0#1); {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:32,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p3~0#1); {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:32,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p4~0#1); {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:32,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p5~0#1); {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:32,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {39936#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p6~0#1; {39935#false} is VALID [2022-02-21 00:02:32,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {39935#false} assume 1 != main_~lk6~0#1; {39935#false} is VALID [2022-02-21 00:02:32,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {39935#false} assume !false; {39935#false} is VALID [2022-02-21 00:02:32,541 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:32,541 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:32,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255392922] [2022-02-21 00:02:32,541 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255392922] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:32,541 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:32,542 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:32,542 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83252282] [2022-02-21 00:02:32,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:32,542 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:32,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:32,543 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:32,560 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:32,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:32,561 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:32,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:32,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:32,561 INFO L87 Difference]: Start difference. First operand 1925 states and 3155 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:32,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:32,839 INFO L93 Difference]: Finished difference Result 2663 states and 4356 transitions. [2022-02-21 00:02:32,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:32,839 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:32,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:32,839 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:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2022-02-21 00:02:32,840 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:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2022-02-21 00:02:32,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 163 transitions. [2022-02-21 00:02:32,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:33,167 INFO L225 Difference]: With dead ends: 2663 [2022-02-21 00:02:33,168 INFO L226 Difference]: Without dead ends: 2663 [2022-02-21 00:02:33,168 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:33,175 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 63 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 204 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:33,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 204 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:33,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2022-02-21 00:02:33,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2661. [2022-02-21 00:02:33,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:33,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2663 states. Second operand has 2661 states, 2660 states have (on average 1.637218045112782) internal successors, (4355), 2660 states have internal predecessors, (4355), 0 states have call successors, (0), 0 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,221 INFO L74 IsIncluded]: Start isIncluded. First operand 2663 states. Second operand has 2661 states, 2660 states have (on average 1.637218045112782) internal successors, (4355), 2660 states have internal predecessors, (4355), 0 states have call successors, (0), 0 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,223 INFO L87 Difference]: Start difference. First operand 2663 states. Second operand has 2661 states, 2660 states have (on average 1.637218045112782) internal successors, (4355), 2660 states have internal predecessors, (4355), 0 states have call successors, (0), 0 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,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:33,420 INFO L93 Difference]: Finished difference Result 2663 states and 4356 transitions. [2022-02-21 00:02:33,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 4356 transitions. [2022-02-21 00:02:33,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:33,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:33,428 INFO L74 IsIncluded]: Start isIncluded. First operand has 2661 states, 2660 states have (on average 1.637218045112782) internal successors, (4355), 2660 states have internal predecessors, (4355), 0 states have call successors, (0), 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 2663 states. [2022-02-21 00:02:33,432 INFO L87 Difference]: Start difference. First operand has 2661 states, 2660 states have (on average 1.637218045112782) internal successors, (4355), 2660 states have internal predecessors, (4355), 0 states have call successors, (0), 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 2663 states. [2022-02-21 00:02:33,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:33,628 INFO L93 Difference]: Finished difference Result 2663 states and 4356 transitions. [2022-02-21 00:02:33,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 4356 transitions. [2022-02-21 00:02:33,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:33,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:33,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:33,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:33,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2661 states, 2660 states have (on average 1.637218045112782) internal successors, (4355), 2660 states have internal predecessors, (4355), 0 states have call successors, (0), 0 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,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2661 states to 2661 states and 4355 transitions. [2022-02-21 00:02:33,854 INFO L78 Accepts]: Start accepts. Automaton has 2661 states and 4355 transitions. Word has length 26 [2022-02-21 00:02:33,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:33,854 INFO L470 AbstractCegarLoop]: Abstraction has 2661 states and 4355 transitions. [2022-02-21 00:02:33,854 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,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2661 states and 4355 transitions. [2022-02-21 00:02:33,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-21 00:02:33,856 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:33,856 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:33,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-21 00:02:33,856 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:33,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:33,857 INFO L85 PathProgramCache]: Analyzing trace with hash -286238638, now seen corresponding path program 1 times [2022-02-21 00:02:33,857 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:33,857 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208080504] [2022-02-21 00:02:33,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:33,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:33,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {50589#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(18, 2);call #Ultimate.allocInit(12, 3); {50589#true} is VALID [2022-02-21 00:02:33,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {50589#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_#t~nondet18#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_~p14~0#1, main_~lk14~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;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {50589#true} is VALID [2022-02-21 00:02:33,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {50589#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {50589#true} is VALID [2022-02-21 00:02:33,892 INFO L290 TraceCheckUtils]: 3: Hoare triple {50589#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;main_~lk14~0#1 := 0; {50589#true} is VALID [2022-02-21 00:02:33,892 INFO L290 TraceCheckUtils]: 4: Hoare triple {50589#true} assume !(0 != main_~p1~0#1); {50589#true} is VALID [2022-02-21 00:02:33,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {50589#true} assume !(0 != main_~p2~0#1); {50589#true} is VALID [2022-02-21 00:02:33,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {50589#true} assume !(0 != main_~p3~0#1); {50589#true} is VALID [2022-02-21 00:02:33,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {50589#true} assume !(0 != main_~p4~0#1); {50589#true} is VALID [2022-02-21 00:02:33,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {50589#true} assume !(0 != main_~p5~0#1); {50589#true} is VALID [2022-02-21 00:02:33,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {50589#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:33,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:33,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:33,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:33,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:33,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p11~0#1); {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:33,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:33,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:33,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:33,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p1~0#1); {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:33,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p2~0#1); {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:33,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p3~0#1); {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:33,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p4~0#1); {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:33,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p5~0#1); {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:33,899 INFO L290 TraceCheckUtils]: 23: Hoare triple {50591#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p6~0#1); {50590#false} is VALID [2022-02-21 00:02:33,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {50590#false} assume 0 != main_~p7~0#1; {50590#false} is VALID [2022-02-21 00:02:33,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {50590#false} assume 1 != main_~lk7~0#1; {50590#false} is VALID [2022-02-21 00:02:33,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {50590#false} assume !false; {50590#false} is VALID [2022-02-21 00:02:33,899 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,900 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:33,900 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208080504] [2022-02-21 00:02:33,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208080504] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:33,900 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:33,900 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:33,900 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465471776] [2022-02-21 00:02:33,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:33,901 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:33,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:33,901 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:33,920 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:33,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:33,920 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:33,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:33,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:33,921 INFO L87 Difference]: Start difference. First operand 2661 states and 4355 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:34,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:34,244 INFO L93 Difference]: Finished difference Result 2695 states and 4356 transitions. [2022-02-21 00:02:34,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:34,244 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:34,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:34,245 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:34,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2022-02-21 00:02:34,245 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:34,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2022-02-21 00:02:34,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 162 transitions. [2022-02-21 00:02:34,350 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:34,582 INFO L225 Difference]: With dead ends: 2695 [2022-02-21 00:02:34,582 INFO L226 Difference]: Without dead ends: 2695 [2022-02-21 00:02:34,582 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,582 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 65 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 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:34,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 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:34,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2695 states. [2022-02-21 00:02:34,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2695 to 2693. [2022-02-21 00:02:34,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:34,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2695 states. Second operand has 2693 states, 2692 states have (on average 1.6177563150074294) internal successors, (4355), 2692 states have internal predecessors, (4355), 0 states have call successors, (0), 0 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,642 INFO L74 IsIncluded]: Start isIncluded. First operand 2695 states. Second operand has 2693 states, 2692 states have (on average 1.6177563150074294) internal successors, (4355), 2692 states have internal predecessors, (4355), 0 states have call successors, (0), 0 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,646 INFO L87 Difference]: Start difference. First operand 2695 states. Second operand has 2693 states, 2692 states have (on average 1.6177563150074294) internal successors, (4355), 2692 states have internal predecessors, (4355), 0 states have call successors, (0), 0 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,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:34,869 INFO L93 Difference]: Finished difference Result 2695 states and 4356 transitions. [2022-02-21 00:02:34,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 4356 transitions. [2022-02-21 00:02:34,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:34,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:34,874 INFO L74 IsIncluded]: Start isIncluded. First operand has 2693 states, 2692 states have (on average 1.6177563150074294) internal successors, (4355), 2692 states have internal predecessors, (4355), 0 states have call successors, (0), 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 2695 states. [2022-02-21 00:02:34,876 INFO L87 Difference]: Start difference. First operand has 2693 states, 2692 states have (on average 1.6177563150074294) internal successors, (4355), 2692 states have internal predecessors, (4355), 0 states have call successors, (0), 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 2695 states. [2022-02-21 00:02:35,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,063 INFO L93 Difference]: Finished difference Result 2695 states and 4356 transitions. [2022-02-21 00:02:35,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 4356 transitions. [2022-02-21 00:02:35,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:35,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:35,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:35,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:35,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2693 states, 2692 states have (on average 1.6177563150074294) internal successors, (4355), 2692 states have internal predecessors, (4355), 0 states have call successors, (0), 0 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,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 4355 transitions. [2022-02-21 00:02:35,259 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 4355 transitions. Word has length 27 [2022-02-21 00:02:35,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:35,259 INFO L470 AbstractCegarLoop]: Abstraction has 2693 states and 4355 transitions. [2022-02-21 00:02:35,259 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:35,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 4355 transitions. [2022-02-21 00:02:35,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-21 00:02:35,261 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:35,261 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:35,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-21 00:02:35,261 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:35,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:35,262 INFO L85 PathProgramCache]: Analyzing trace with hash 2014583952, now seen corresponding path program 1 times [2022-02-21 00:02:35,262 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:35,263 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678301053] [2022-02-21 00:02:35,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:35,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:35,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {61372#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(18, 2);call #Ultimate.allocInit(12, 3); {61372#true} is VALID [2022-02-21 00:02:35,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {61372#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_#t~nondet18#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_~p14~0#1, main_~lk14~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;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {61372#true} is VALID [2022-02-21 00:02:35,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {61372#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {61372#true} is VALID [2022-02-21 00:02:35,292 INFO L290 TraceCheckUtils]: 3: Hoare triple {61372#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;main_~lk14~0#1 := 0; {61372#true} is VALID [2022-02-21 00:02:35,292 INFO L290 TraceCheckUtils]: 4: Hoare triple {61372#true} assume !(0 != main_~p1~0#1); {61372#true} is VALID [2022-02-21 00:02:35,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {61372#true} assume !(0 != main_~p2~0#1); {61372#true} is VALID [2022-02-21 00:02:35,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {61372#true} assume !(0 != main_~p3~0#1); {61372#true} is VALID [2022-02-21 00:02:35,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {61372#true} assume !(0 != main_~p4~0#1); {61372#true} is VALID [2022-02-21 00:02:35,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {61372#true} assume !(0 != main_~p5~0#1); {61372#true} is VALID [2022-02-21 00:02:35,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {61372#true} assume !(0 != main_~p6~0#1); {61372#true} is VALID [2022-02-21 00:02:35,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {61372#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:35,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:35,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:35,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:35,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p11~0#1); {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:35,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:35,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:35,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:35,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p1~0#1); {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:35,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p2~0#1); {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:35,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p3~0#1); {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:35,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p4~0#1); {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:35,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p5~0#1); {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:35,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p6~0#1); {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:35,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p7~0#1; {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:35,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {61374#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 1 != main_~lk7~0#1; {61373#false} is VALID [2022-02-21 00:02:35,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {61373#false} assume !false; {61373#false} is VALID [2022-02-21 00:02:35,299 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:35,299 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:35,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678301053] [2022-02-21 00:02:35,300 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678301053] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:35,300 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:35,300 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:35,300 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568635603] [2022-02-21 00:02:35,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:35,301 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:35,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:35,301 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:35,318 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:35,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:35,319 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:35,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:35,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:35,319 INFO L87 Difference]: Start difference. First operand 2693 states and 4355 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:36,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:36,047 INFO L93 Difference]: Finished difference Result 4871 states and 7972 transitions. [2022-02-21 00:02:36,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:36,047 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,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:36,047 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:36,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2022-02-21 00:02:36,048 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:36,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2022-02-21 00:02:36,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2022-02-21 00:02:36,138 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:36,913 INFO L225 Difference]: With dead ends: 4871 [2022-02-21 00:02:36,914 INFO L226 Difference]: Without dead ends: 4871 [2022-02-21 00:02:36,914 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:36,914 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 50 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 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:36,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 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:36,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4871 states. [2022-02-21 00:02:36,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4871 to 3845. [2022-02-21 00:02:36,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:36,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4871 states. Second operand has 3845 states, 3844 states have (on average 1.5741415192507804) internal successors, (6051), 3844 states have internal predecessors, (6051), 0 states have call successors, (0), 0 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,992 INFO L74 IsIncluded]: Start isIncluded. First operand 4871 states. Second operand has 3845 states, 3844 states have (on average 1.5741415192507804) internal successors, (6051), 3844 states have internal predecessors, (6051), 0 states have call successors, (0), 0 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,998 INFO L87 Difference]: Start difference. First operand 4871 states. Second operand has 3845 states, 3844 states have (on average 1.5741415192507804) internal successors, (6051), 3844 states have internal predecessors, (6051), 0 states have call successors, (0), 0 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,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:37,667 INFO L93 Difference]: Finished difference Result 4871 states and 7972 transitions. [2022-02-21 00:02:37,667 INFO L276 IsEmpty]: Start isEmpty. Operand 4871 states and 7972 transitions. [2022-02-21 00:02:37,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:37,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:37,675 INFO L74 IsIncluded]: Start isIncluded. First operand has 3845 states, 3844 states have (on average 1.5741415192507804) internal successors, (6051), 3844 states have internal predecessors, (6051), 0 states have call successors, (0), 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:37,677 INFO L87 Difference]: Start difference. First operand has 3845 states, 3844 states have (on average 1.5741415192507804) internal successors, (6051), 3844 states have internal predecessors, (6051), 0 states have call successors, (0), 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:38,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:38,301 INFO L93 Difference]: Finished difference Result 4871 states and 7972 transitions. [2022-02-21 00:02:38,301 INFO L276 IsEmpty]: Start isEmpty. Operand 4871 states and 7972 transitions. [2022-02-21 00:02:38,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:38,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:38,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:38,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:38,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3845 states, 3844 states have (on average 1.5741415192507804) internal successors, (6051), 3844 states have internal predecessors, (6051), 0 states have call successors, (0), 0 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,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 6051 transitions. [2022-02-21 00:02:38,744 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 6051 transitions. Word has length 27 [2022-02-21 00:02:38,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:38,745 INFO L470 AbstractCegarLoop]: Abstraction has 3845 states and 6051 transitions. [2022-02-21 00:02:38,745 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:38,745 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 6051 transitions. [2022-02-21 00:02:38,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-21 00:02:38,748 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:38,748 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:38,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-21 00:02:38,749 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:38,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:38,750 INFO L85 PathProgramCache]: Analyzing trace with hash 426236050, now seen corresponding path program 1 times [2022-02-21 00:02:38,750 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:38,750 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797578672] [2022-02-21 00:02:38,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:38,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:38,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {79835#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(18, 2);call #Ultimate.allocInit(12, 3); {79835#true} is VALID [2022-02-21 00:02:38,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {79835#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_#t~nondet18#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_~p14~0#1, main_~lk14~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;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {79835#true} is VALID [2022-02-21 00:02:38,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {79835#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {79835#true} is VALID [2022-02-21 00:02:38,815 INFO L290 TraceCheckUtils]: 3: Hoare triple {79835#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;main_~lk14~0#1 := 0; {79835#true} is VALID [2022-02-21 00:02:38,815 INFO L290 TraceCheckUtils]: 4: Hoare triple {79835#true} assume !(0 != main_~p1~0#1); {79835#true} is VALID [2022-02-21 00:02:38,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {79835#true} assume !(0 != main_~p2~0#1); {79835#true} is VALID [2022-02-21 00:02:38,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {79835#true} assume !(0 != main_~p3~0#1); {79835#true} is VALID [2022-02-21 00:02:38,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {79835#true} assume !(0 != main_~p4~0#1); {79835#true} is VALID [2022-02-21 00:02:38,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {79835#true} assume !(0 != main_~p5~0#1); {79835#true} is VALID [2022-02-21 00:02:38,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {79835#true} assume !(0 != main_~p6~0#1); {79835#true} is VALID [2022-02-21 00:02:38,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {79835#true} assume !(0 != main_~p7~0#1); {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:38,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:38,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:38,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:38,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p11~0#1); {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:38,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:38,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:38,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:38,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p1~0#1); {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:38,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p2~0#1); {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:38,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p3~0#1); {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:38,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p4~0#1); {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:38,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p5~0#1); {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:38,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p6~0#1); {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:38,821 INFO L290 TraceCheckUtils]: 24: Hoare triple {79837#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p7~0#1; {79836#false} is VALID [2022-02-21 00:02:38,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {79836#false} assume 1 != main_~lk7~0#1; {79836#false} is VALID [2022-02-21 00:02:38,821 INFO L290 TraceCheckUtils]: 26: Hoare triple {79836#false} assume !false; {79836#false} is VALID [2022-02-21 00:02:38,822 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:38,822 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:38,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797578672] [2022-02-21 00:02:38,822 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797578672] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:38,822 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:38,822 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:38,823 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306624813] [2022-02-21 00:02:38,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:38,823 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:38,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:38,824 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:38,854 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:38,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:38,855 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:38,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:38,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:38,855 INFO L87 Difference]: Start difference. First operand 3845 states and 6051 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:39,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:39,658 INFO L93 Difference]: Finished difference Result 5255 states and 8260 transitions. [2022-02-21 00:02:39,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:39,659 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:39,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:39,659 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:39,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2022-02-21 00:02:39,660 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:39,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2022-02-21 00:02:39,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 161 transitions. [2022-02-21 00:02:39,753 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:40,649 INFO L225 Difference]: With dead ends: 5255 [2022-02-21 00:02:40,649 INFO L226 Difference]: Without dead ends: 5255 [2022-02-21 00:02:40,650 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:40,650 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 62 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 205 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:40,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 205 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:40,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5255 states. [2022-02-21 00:02:40,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5255 to 5253. [2022-02-21 00:02:40,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:40,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5255 states. Second operand has 5253 states, 5252 states have (on average 1.5725437928408226) internal successors, (8259), 5252 states have internal predecessors, (8259), 0 states have call successors, (0), 0 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,749 INFO L74 IsIncluded]: Start isIncluded. First operand 5255 states. Second operand has 5253 states, 5252 states have (on average 1.5725437928408226) internal successors, (8259), 5252 states have internal predecessors, (8259), 0 states have call successors, (0), 0 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,755 INFO L87 Difference]: Start difference. First operand 5255 states. Second operand has 5253 states, 5252 states have (on average 1.5725437928408226) internal successors, (8259), 5252 states have internal predecessors, (8259), 0 states have call successors, (0), 0 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:41,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:41,471 INFO L93 Difference]: Finished difference Result 5255 states and 8260 transitions. [2022-02-21 00:02:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 5255 states and 8260 transitions. [2022-02-21 00:02:41,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:41,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:41,480 INFO L74 IsIncluded]: Start isIncluded. First operand has 5253 states, 5252 states have (on average 1.5725437928408226) internal successors, (8259), 5252 states have internal predecessors, (8259), 0 states have call successors, (0), 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 5255 states. [2022-02-21 00:02:41,484 INFO L87 Difference]: Start difference. First operand has 5253 states, 5252 states have (on average 1.5725437928408226) internal successors, (8259), 5252 states have internal predecessors, (8259), 0 states have call successors, (0), 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 5255 states. [2022-02-21 00:02:42,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,195 INFO L93 Difference]: Finished difference Result 5255 states and 8260 transitions. [2022-02-21 00:02:42,195 INFO L276 IsEmpty]: Start isEmpty. Operand 5255 states and 8260 transitions. [2022-02-21 00:02:42,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:42,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:42,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:42,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:42,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5253 states, 5252 states have (on average 1.5725437928408226) internal successors, (8259), 5252 states have internal predecessors, (8259), 0 states have call successors, (0), 0 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,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5253 states to 5253 states and 8259 transitions. [2022-02-21 00:02:42,871 INFO L78 Accepts]: Start accepts. Automaton has 5253 states and 8259 transitions. Word has length 27 [2022-02-21 00:02:42,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:42,872 INFO L470 AbstractCegarLoop]: Abstraction has 5253 states and 8259 transitions. [2022-02-21 00:02:42,872 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:42,872 INFO L276 IsEmpty]: Start isEmpty. Operand 5253 states and 8259 transitions. [2022-02-21 00:02:42,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-21 00:02:42,874 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:42,874 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:02:42,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-21 00:02:42,875 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:42,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:42,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1972192830, now seen corresponding path program 1 times [2022-02-21 00:02:42,875 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:42,875 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415560793] [2022-02-21 00:02:42,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:42,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:42,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {100858#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(18, 2);call #Ultimate.allocInit(12, 3); {100858#true} is VALID [2022-02-21 00:02:42,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {100858#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_#t~nondet18#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_~p14~0#1, main_~lk14~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;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {100858#true} is VALID [2022-02-21 00:02:42,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {100858#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {100858#true} is VALID [2022-02-21 00:02:42,917 INFO L290 TraceCheckUtils]: 3: Hoare triple {100858#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;main_~lk14~0#1 := 0; {100858#true} is VALID [2022-02-21 00:02:42,917 INFO L290 TraceCheckUtils]: 4: Hoare triple {100858#true} assume !(0 != main_~p1~0#1); {100858#true} is VALID [2022-02-21 00:02:42,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {100858#true} assume !(0 != main_~p2~0#1); {100858#true} is VALID [2022-02-21 00:02:42,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {100858#true} assume !(0 != main_~p3~0#1); {100858#true} is VALID [2022-02-21 00:02:42,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {100858#true} assume !(0 != main_~p4~0#1); {100858#true} is VALID [2022-02-21 00:02:42,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {100858#true} assume !(0 != main_~p5~0#1); {100858#true} is VALID [2022-02-21 00:02:42,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {100858#true} assume !(0 != main_~p6~0#1); {100858#true} is VALID [2022-02-21 00:02:42,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {100858#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:42,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:42,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:42,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:42,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p11~0#1); {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:42,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:42,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:42,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:42,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p1~0#1); {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:42,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p2~0#1); {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:42,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p3~0#1); {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:42,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p4~0#1); {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:42,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p5~0#1); {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:42,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p6~0#1); {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:42,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {100860#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p7~0#1); {100859#false} is VALID [2022-02-21 00:02:42,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {100859#false} assume 0 != main_~p8~0#1; {100859#false} is VALID [2022-02-21 00:02:42,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {100859#false} assume 1 != main_~lk8~0#1; {100859#false} is VALID [2022-02-21 00:02:42,928 INFO L290 TraceCheckUtils]: 27: Hoare triple {100859#false} assume !false; {100859#false} is VALID [2022-02-21 00:02:42,928 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:42,929 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:42,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415560793] [2022-02-21 00:02:42,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415560793] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:42,935 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:42,935 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:42,936 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151769095] [2022-02-21 00:02:42,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:42,936 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:02:42,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:42,937 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:02:42,956 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:02:42,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:42,957 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:42,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:42,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:42,958 INFO L87 Difference]: Start difference. First operand 5253 states and 8259 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:02:43,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:43,783 INFO L93 Difference]: Finished difference Result 5319 states and 8260 transitions. [2022-02-21 00:02:43,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:43,784 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:02:43,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:43,784 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:02:43,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2022-02-21 00:02:43,785 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:02:43,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2022-02-21 00:02:43,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 160 transitions. [2022-02-21 00:02:43,882 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:44,794 INFO L225 Difference]: With dead ends: 5319 [2022-02-21 00:02:44,794 INFO L226 Difference]: Without dead ends: 5319 [2022-02-21 00:02:44,794 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,795 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 64 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 200 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:44,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 200 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:44,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5319 states. [2022-02-21 00:02:44,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5319 to 5317. [2022-02-21 00:02:44,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:44,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5319 states. Second operand has 5317 states, 5316 states have (on average 1.5536117381489842) internal successors, (8259), 5316 states have internal predecessors, (8259), 0 states have call successors, (0), 0 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,873 INFO L74 IsIncluded]: Start isIncluded. First operand 5319 states. Second operand has 5317 states, 5316 states have (on average 1.5536117381489842) internal successors, (8259), 5316 states have internal predecessors, (8259), 0 states have call successors, (0), 0 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,880 INFO L87 Difference]: Start difference. First operand 5319 states. Second operand has 5317 states, 5316 states have (on average 1.5536117381489842) internal successors, (8259), 5316 states have internal predecessors, (8259), 0 states have call successors, (0), 0 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:45,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:45,631 INFO L93 Difference]: Finished difference Result 5319 states and 8260 transitions. [2022-02-21 00:02:45,631 INFO L276 IsEmpty]: Start isEmpty. Operand 5319 states and 8260 transitions. [2022-02-21 00:02:45,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:45,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:45,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 5317 states, 5316 states have (on average 1.5536117381489842) internal successors, (8259), 5316 states have internal predecessors, (8259), 0 states have call successors, (0), 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 5319 states. [2022-02-21 00:02:45,644 INFO L87 Difference]: Start difference. First operand has 5317 states, 5316 states have (on average 1.5536117381489842) internal successors, (8259), 5316 states have internal predecessors, (8259), 0 states have call successors, (0), 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 5319 states. [2022-02-21 00:02:46,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:46,339 INFO L93 Difference]: Finished difference Result 5319 states and 8260 transitions. [2022-02-21 00:02:46,339 INFO L276 IsEmpty]: Start isEmpty. Operand 5319 states and 8260 transitions. [2022-02-21 00:02:46,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:46,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:46,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:46,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:46,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5317 states, 5316 states have (on average 1.5536117381489842) internal successors, (8259), 5316 states have internal predecessors, (8259), 0 states have call successors, (0), 0 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:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5317 states to 5317 states and 8259 transitions. [2022-02-21 00:02:47,090 INFO L78 Accepts]: Start accepts. Automaton has 5317 states and 8259 transitions. Word has length 28 [2022-02-21 00:02:47,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:47,091 INFO L470 AbstractCegarLoop]: Abstraction has 5317 states and 8259 transitions. [2022-02-21 00:02:47,091 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:02:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 5317 states and 8259 transitions. [2022-02-21 00:02:47,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-21 00:02:47,092 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:47,093 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:02:47,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-21 00:02:47,093 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:47,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:47,093 INFO L85 PathProgramCache]: Analyzing trace with hash 328629760, now seen corresponding path program 1 times [2022-02-21 00:02:47,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:47,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771292851] [2022-02-21 00:02:47,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:47,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:47,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {122137#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(18, 2);call #Ultimate.allocInit(12, 3); {122137#true} is VALID [2022-02-21 00:02:47,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {122137#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_#t~nondet18#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_~p14~0#1, main_~lk14~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;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {122137#true} is VALID [2022-02-21 00:02:47,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {122137#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {122137#true} is VALID [2022-02-21 00:02:47,131 INFO L290 TraceCheckUtils]: 3: Hoare triple {122137#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;main_~lk14~0#1 := 0; {122137#true} is VALID [2022-02-21 00:02:47,132 INFO L290 TraceCheckUtils]: 4: Hoare triple {122137#true} assume !(0 != main_~p1~0#1); {122137#true} is VALID [2022-02-21 00:02:47,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {122137#true} assume !(0 != main_~p2~0#1); {122137#true} is VALID [2022-02-21 00:02:47,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {122137#true} assume !(0 != main_~p3~0#1); {122137#true} is VALID [2022-02-21 00:02:47,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {122137#true} assume !(0 != main_~p4~0#1); {122137#true} is VALID [2022-02-21 00:02:47,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {122137#true} assume !(0 != main_~p5~0#1); {122137#true} is VALID [2022-02-21 00:02:47,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {122137#true} assume !(0 != main_~p6~0#1); {122137#true} is VALID [2022-02-21 00:02:47,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {122137#true} assume !(0 != main_~p7~0#1); {122137#true} is VALID [2022-02-21 00:02:47,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {122137#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:47,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:47,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:47,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p11~0#1); {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:47,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:47,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:47,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:47,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p1~0#1); {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:47,136 INFO L290 TraceCheckUtils]: 19: Hoare triple {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p2~0#1); {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:47,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p3~0#1); {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:47,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p4~0#1); {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:47,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p5~0#1); {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:47,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p6~0#1); {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:47,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p7~0#1); {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:47,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p8~0#1; {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:47,138 INFO L290 TraceCheckUtils]: 26: Hoare triple {122139#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 1 != main_~lk8~0#1; {122138#false} is VALID [2022-02-21 00:02:47,138 INFO L290 TraceCheckUtils]: 27: Hoare triple {122138#false} assume !false; {122138#false} is VALID [2022-02-21 00:02:47,139 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:47,139 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:47,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771292851] [2022-02-21 00:02:47,139 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771292851] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:47,139 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:47,139 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:47,140 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013270433] [2022-02-21 00:02:47,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:47,140 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:02:47,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:47,140 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:02:47,158 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:02:47,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:47,158 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:47,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:47,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:47,159 INFO L87 Difference]: Start difference. First operand 5317 states and 8259 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:02:49,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:49,479 INFO L93 Difference]: Finished difference Result 9479 states and 14916 transitions. [2022-02-21 00:02:49,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:49,479 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:02:49,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:49,479 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:02:49,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2022-02-21 00:02:49,480 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:02:49,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2022-02-21 00:02:49,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 146 transitions. [2022-02-21 00:02:49,565 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:52,495 INFO L225 Difference]: With dead ends: 9479 [2022-02-21 00:02:52,495 INFO L226 Difference]: Without dead ends: 9479 [2022-02-21 00:02:52,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:52,496 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 47 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 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:52,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 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:52,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9479 states. [2022-02-21 00:02:52,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9479 to 7685. [2022-02-21 00:02:52,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:52,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9479 states. Second operand has 7685 states, 7684 states have (on average 1.5079385736595523) internal successors, (11587), 7684 states have internal predecessors, (11587), 0 states have call successors, (0), 0 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,589 INFO L74 IsIncluded]: Start isIncluded. First operand 9479 states. Second operand has 7685 states, 7684 states have (on average 1.5079385736595523) internal successors, (11587), 7684 states have internal predecessors, (11587), 0 states have call successors, (0), 0 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,596 INFO L87 Difference]: Start difference. First operand 9479 states. Second operand has 7685 states, 7684 states have (on average 1.5079385736595523) internal successors, (11587), 7684 states have internal predecessors, (11587), 0 states have call successors, (0), 0 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:54,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:54,894 INFO L93 Difference]: Finished difference Result 9479 states and 14916 transitions. [2022-02-21 00:02:54,894 INFO L276 IsEmpty]: Start isEmpty. Operand 9479 states and 14916 transitions. [2022-02-21 00:02:54,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:54,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:54,907 INFO L74 IsIncluded]: Start isIncluded. First operand has 7685 states, 7684 states have (on average 1.5079385736595523) internal successors, (11587), 7684 states have internal predecessors, (11587), 0 states have call successors, (0), 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 9479 states. [2022-02-21 00:02:54,930 INFO L87 Difference]: Start difference. First operand has 7685 states, 7684 states have (on average 1.5079385736595523) internal successors, (11587), 7684 states have internal predecessors, (11587), 0 states have call successors, (0), 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 9479 states. [2022-02-21 00:02:57,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:57,461 INFO L93 Difference]: Finished difference Result 9479 states and 14916 transitions. [2022-02-21 00:02:57,461 INFO L276 IsEmpty]: Start isEmpty. Operand 9479 states and 14916 transitions. [2022-02-21 00:02:57,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:57,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:57,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:57,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:57,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7685 states, 7684 states have (on average 1.5079385736595523) internal successors, (11587), 7684 states have internal predecessors, (11587), 0 states have call successors, (0), 0 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:59,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7685 states to 7685 states and 11587 transitions. [2022-02-21 00:02:59,031 INFO L78 Accepts]: Start accepts. Automaton has 7685 states and 11587 transitions. Word has length 28 [2022-02-21 00:02:59,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:59,031 INFO L470 AbstractCegarLoop]: Abstraction has 7685 states and 11587 transitions. [2022-02-21 00:02:59,031 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:02:59,032 INFO L276 IsEmpty]: Start isEmpty. Operand 7685 states and 11587 transitions. [2022-02-21 00:02:59,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-21 00:02:59,035 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:59,035 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:02:59,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-21 00:02:59,035 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:59,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:59,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1259718142, now seen corresponding path program 1 times [2022-02-21 00:02:59,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:59,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376704464] [2022-02-21 00:02:59,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:59,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:59,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {158264#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(18, 2);call #Ultimate.allocInit(12, 3); {158264#true} is VALID [2022-02-21 00:02:59,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {158264#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_#t~nondet18#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_~p14~0#1, main_~lk14~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;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {158264#true} is VALID [2022-02-21 00:02:59,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {158264#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {158264#true} is VALID [2022-02-21 00:02:59,060 INFO L290 TraceCheckUtils]: 3: Hoare triple {158264#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;main_~lk14~0#1 := 0; {158264#true} is VALID [2022-02-21 00:02:59,061 INFO L290 TraceCheckUtils]: 4: Hoare triple {158264#true} assume !(0 != main_~p1~0#1); {158264#true} is VALID [2022-02-21 00:02:59,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {158264#true} assume !(0 != main_~p2~0#1); {158264#true} is VALID [2022-02-21 00:02:59,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {158264#true} assume !(0 != main_~p3~0#1); {158264#true} is VALID [2022-02-21 00:02:59,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {158264#true} assume !(0 != main_~p4~0#1); {158264#true} is VALID [2022-02-21 00:02:59,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {158264#true} assume !(0 != main_~p5~0#1); {158264#true} is VALID [2022-02-21 00:02:59,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {158264#true} assume !(0 != main_~p6~0#1); {158264#true} is VALID [2022-02-21 00:02:59,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {158264#true} assume !(0 != main_~p7~0#1); {158264#true} is VALID [2022-02-21 00:02:59,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {158264#true} assume !(0 != main_~p8~0#1); {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:59,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:59,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:59,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p11~0#1); {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:59,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:59,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:59,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:59,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p1~0#1); {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:59,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p2~0#1); {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:59,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p3~0#1); {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:59,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p4~0#1); {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:59,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p5~0#1); {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:59,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p6~0#1); {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:59,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p7~0#1); {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:59,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {158266#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p8~0#1; {158265#false} is VALID [2022-02-21 00:02:59,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {158265#false} assume 1 != main_~lk8~0#1; {158265#false} is VALID [2022-02-21 00:02:59,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {158265#false} assume !false; {158265#false} is VALID [2022-02-21 00:02:59,067 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:59,067 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:59,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376704464] [2022-02-21 00:02:59,068 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376704464] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:59,068 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:59,068 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:59,068 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978172659] [2022-02-21 00:02:59,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:59,069 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:02:59,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:59,069 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:02:59,086 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:02:59,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:59,087 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:59,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:59,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:59,088 INFO L87 Difference]: Start difference. First operand 7685 states and 11587 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:02,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:02,022 INFO L93 Difference]: Finished difference Result 10375 states and 15620 transitions. [2022-02-21 00:03:02,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:03:02,022 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,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:02,022 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:02,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2022-02-21 00:03:02,023 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:02,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2022-02-21 00:03:02,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 159 transitions. [2022-02-21 00:03:02,116 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:03:05,603 INFO L225 Difference]: With dead ends: 10375 [2022-02-21 00:03:05,603 INFO L226 Difference]: Without dead ends: 10375 [2022-02-21 00:03:05,603 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:05,604 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 61 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 206 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:03:05,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 206 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:05,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10375 states. [2022-02-21 00:03:05,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10375 to 10373. [2022-02-21 00:03:05,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:05,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10375 states. Second operand has 10373 states, 10372 states have (on average 1.5058812186656383) internal successors, (15619), 10372 states have internal predecessors, (15619), 0 states have call successors, (0), 0 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,750 INFO L74 IsIncluded]: Start isIncluded. First operand 10375 states. Second operand has 10373 states, 10372 states have (on average 1.5058812186656383) internal successors, (15619), 10372 states have internal predecessors, (15619), 0 states have call successors, (0), 0 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,763 INFO L87 Difference]: Start difference. First operand 10375 states. Second operand has 10373 states, 10372 states have (on average 1.5058812186656383) internal successors, (15619), 10372 states have internal predecessors, (15619), 0 states have call successors, (0), 0 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,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:08,614 INFO L93 Difference]: Finished difference Result 10375 states and 15620 transitions. [2022-02-21 00:03:08,614 INFO L276 IsEmpty]: Start isEmpty. Operand 10375 states and 15620 transitions. [2022-02-21 00:03:08,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:08,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:08,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 10373 states, 10372 states have (on average 1.5058812186656383) internal successors, (15619), 10372 states have internal predecessors, (15619), 0 states have call successors, (0), 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 10375 states. [2022-02-21 00:03:08,665 INFO L87 Difference]: Start difference. First operand has 10373 states, 10372 states have (on average 1.5058812186656383) internal successors, (15619), 10372 states have internal predecessors, (15619), 0 states have call successors, (0), 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 10375 states. [2022-02-21 00:03:11,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:11,612 INFO L93 Difference]: Finished difference Result 10375 states and 15620 transitions. [2022-02-21 00:03:11,612 INFO L276 IsEmpty]: Start isEmpty. Operand 10375 states and 15620 transitions. [2022-02-21 00:03:11,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:11,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:11,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:11,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10373 states, 10372 states have (on average 1.5058812186656383) internal successors, (15619), 10372 states have internal predecessors, (15619), 0 states have call successors, (0), 0 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:14,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10373 states to 10373 states and 15619 transitions. [2022-02-21 00:03:14,099 INFO L78 Accepts]: Start accepts. Automaton has 10373 states and 15619 transitions. Word has length 28 [2022-02-21 00:03:14,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:14,099 INFO L470 AbstractCegarLoop]: Abstraction has 10373 states and 15619 transitions. [2022-02-21 00:03:14,099 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:14,100 INFO L276 IsEmpty]: Start isEmpty. Operand 10373 states and 15619 transitions. [2022-02-21 00:03:14,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-21 00:03:14,105 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:14,105 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, 1] [2022-02-21 00:03:14,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-21 00:03:14,106 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:03:14,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:14,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1597802407, now seen corresponding path program 1 times [2022-02-21 00:03:14,106 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:14,107 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540706371] [2022-02-21 00:03:14,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:14,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:14,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {199767#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(18, 2);call #Ultimate.allocInit(12, 3); {199767#true} is VALID [2022-02-21 00:03:14,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {199767#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_#t~nondet18#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_~p14~0#1, main_~lk14~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;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {199767#true} is VALID [2022-02-21 00:03:14,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {199767#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {199767#true} is VALID [2022-02-21 00:03:14,133 INFO L290 TraceCheckUtils]: 3: Hoare triple {199767#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;main_~lk14~0#1 := 0; {199767#true} is VALID [2022-02-21 00:03:14,133 INFO L290 TraceCheckUtils]: 4: Hoare triple {199767#true} assume !(0 != main_~p1~0#1); {199767#true} is VALID [2022-02-21 00:03:14,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {199767#true} assume !(0 != main_~p2~0#1); {199767#true} is VALID [2022-02-21 00:03:14,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {199767#true} assume !(0 != main_~p3~0#1); {199767#true} is VALID [2022-02-21 00:03:14,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {199767#true} assume !(0 != main_~p4~0#1); {199767#true} is VALID [2022-02-21 00:03:14,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {199767#true} assume !(0 != main_~p5~0#1); {199767#true} is VALID [2022-02-21 00:03:14,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {199767#true} assume !(0 != main_~p6~0#1); {199767#true} is VALID [2022-02-21 00:03:14,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {199767#true} assume !(0 != main_~p7~0#1); {199767#true} is VALID [2022-02-21 00:03:14,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {199767#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:14,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:14,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:14,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p11~0#1); {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:14,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:14,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:14,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:14,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p1~0#1); {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:14,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p2~0#1); {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:14,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p3~0#1); {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:14,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p4~0#1); {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:14,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p5~0#1); {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:14,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p6~0#1); {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:14,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p7~0#1); {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:14,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {199769#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p8~0#1); {199768#false} is VALID [2022-02-21 00:03:14,140 INFO L290 TraceCheckUtils]: 26: Hoare triple {199768#false} assume 0 != main_~p9~0#1; {199768#false} is VALID [2022-02-21 00:03:14,140 INFO L290 TraceCheckUtils]: 27: Hoare triple {199768#false} assume 1 != main_~lk9~0#1; {199768#false} is VALID [2022-02-21 00:03:14,140 INFO L290 TraceCheckUtils]: 28: Hoare triple {199768#false} assume !false; {199768#false} is VALID [2022-02-21 00:03:14,140 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:14,140 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:14,141 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540706371] [2022-02-21 00:03:14,141 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540706371] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:14,141 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:14,141 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:03:14,141 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000134275] [2022-02-21 00:03:14,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:14,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-02-21 00:03:14,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:14,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 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:14,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:14,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:03:14,162 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:14,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:03:14,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:14,163 INFO L87 Difference]: Start difference. First operand 10373 states and 15619 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 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:16,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:16,843 INFO L93 Difference]: Finished difference Result 10503 states and 15620 transitions. [2022-02-21 00:03:16,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:03:16,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-02-21 00:03:16,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:16,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 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:16,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2022-02-21 00:03:16,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 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:16,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2022-02-21 00:03:16,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 158 transitions. [2022-02-21 00:03:16,962 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:03:20,389 INFO L225 Difference]: With dead ends: 10503 [2022-02-21 00:03:20,389 INFO L226 Difference]: Without dead ends: 10503 [2022-02-21 00:03:20,390 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:20,390 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 63 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 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:03:20,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 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:03:20,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10503 states. [2022-02-21 00:03:20,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10503 to 10501. [2022-02-21 00:03:20,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:20,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10503 states. Second operand has 10501 states, 10500 states have (on average 1.4875238095238095) internal successors, (15619), 10500 states have internal predecessors, (15619), 0 states have call successors, (0), 0 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:20,518 INFO L74 IsIncluded]: Start isIncluded. First operand 10503 states. Second operand has 10501 states, 10500 states have (on average 1.4875238095238095) internal successors, (15619), 10500 states have internal predecessors, (15619), 0 states have call successors, (0), 0 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:20,534 INFO L87 Difference]: Start difference. First operand 10503 states. Second operand has 10501 states, 10500 states have (on average 1.4875238095238095) internal successors, (15619), 10500 states have internal predecessors, (15619), 0 states have call successors, (0), 0 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:23,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:23,174 INFO L93 Difference]: Finished difference Result 10503 states and 15620 transitions. [2022-02-21 00:03:23,174 INFO L276 IsEmpty]: Start isEmpty. Operand 10503 states and 15620 transitions. [2022-02-21 00:03:23,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:23,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:23,190 INFO L74 IsIncluded]: Start isIncluded. First operand has 10501 states, 10500 states have (on average 1.4875238095238095) internal successors, (15619), 10500 states have internal predecessors, (15619), 0 states have call successors, (0), 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 10503 states. [2022-02-21 00:03:23,210 INFO L87 Difference]: Start difference. First operand has 10501 states, 10500 states have (on average 1.4875238095238095) internal successors, (15619), 10500 states have internal predecessors, (15619), 0 states have call successors, (0), 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 10503 states. [2022-02-21 00:03:26,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:26,023 INFO L93 Difference]: Finished difference Result 10503 states and 15620 transitions. [2022-02-21 00:03:26,023 INFO L276 IsEmpty]: Start isEmpty. Operand 10503 states and 15620 transitions. [2022-02-21 00:03:26,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:26,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:26,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:26,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:26,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10501 states, 10500 states have (on average 1.4875238095238095) internal successors, (15619), 10500 states have internal predecessors, (15619), 0 states have call successors, (0), 0 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:28,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10501 states to 10501 states and 15619 transitions. [2022-02-21 00:03:28,728 INFO L78 Accepts]: Start accepts. Automaton has 10501 states and 15619 transitions. Word has length 29 [2022-02-21 00:03:28,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:28,728 INFO L470 AbstractCegarLoop]: Abstraction has 10501 states and 15619 transitions. [2022-02-21 00:03:28,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 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:28,729 INFO L276 IsEmpty]: Start isEmpty. Operand 10501 states and 15619 transitions. [2022-02-21 00:03:28,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-21 00:03:28,734 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:28,734 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, 1] [2022-02-21 00:03:28,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-21 00:03:28,734 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:03:28,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:28,735 INFO L85 PathProgramCache]: Analyzing trace with hash -396342299, now seen corresponding path program 1 times [2022-02-21 00:03:28,735 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:28,735 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91289279] [2022-02-21 00:03:28,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:28,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:28,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {241782#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(18, 2);call #Ultimate.allocInit(12, 3); {241782#true} is VALID [2022-02-21 00:03:28,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {241782#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_#t~nondet18#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_~p14~0#1, main_~lk14~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;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {241782#true} is VALID [2022-02-21 00:03:28,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {241782#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {241782#true} is VALID [2022-02-21 00:03:28,762 INFO L290 TraceCheckUtils]: 3: Hoare triple {241782#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;main_~lk14~0#1 := 0; {241782#true} is VALID [2022-02-21 00:03:28,762 INFO L290 TraceCheckUtils]: 4: Hoare triple {241782#true} assume !(0 != main_~p1~0#1); {241782#true} is VALID [2022-02-21 00:03:28,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {241782#true} assume !(0 != main_~p2~0#1); {241782#true} is VALID [2022-02-21 00:03:28,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {241782#true} assume !(0 != main_~p3~0#1); {241782#true} is VALID [2022-02-21 00:03:28,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {241782#true} assume !(0 != main_~p4~0#1); {241782#true} is VALID [2022-02-21 00:03:28,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {241782#true} assume !(0 != main_~p5~0#1); {241782#true} is VALID [2022-02-21 00:03:28,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {241782#true} assume !(0 != main_~p6~0#1); {241782#true} is VALID [2022-02-21 00:03:28,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {241782#true} assume !(0 != main_~p7~0#1); {241782#true} is VALID [2022-02-21 00:03:28,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {241782#true} assume !(0 != main_~p8~0#1); {241782#true} is VALID [2022-02-21 00:03:28,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {241782#true} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:28,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:28,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p11~0#1); {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:28,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:28,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:28,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:28,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p1~0#1); {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:28,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p2~0#1); {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:28,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p3~0#1); {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:28,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p4~0#1); {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:28,767 INFO L290 TraceCheckUtils]: 22: Hoare triple {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p5~0#1); {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:28,767 INFO L290 TraceCheckUtils]: 23: Hoare triple {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p6~0#1); {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:28,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p7~0#1); {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:28,768 INFO L290 TraceCheckUtils]: 25: Hoare triple {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p8~0#1); {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:28,768 INFO L290 TraceCheckUtils]: 26: Hoare triple {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 0 != main_~p9~0#1; {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:28,769 INFO L290 TraceCheckUtils]: 27: Hoare triple {241784#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 1 != main_~lk9~0#1; {241783#false} is VALID [2022-02-21 00:03:28,769 INFO L290 TraceCheckUtils]: 28: Hoare triple {241783#false} assume !false; {241783#false} is VALID [2022-02-21 00:03:28,769 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:28,769 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:28,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91289279] [2022-02-21 00:03:28,769 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91289279] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:28,770 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:28,770 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:03:28,770 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35056951] [2022-02-21 00:03:28,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:28,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-02-21 00:03:28,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:28,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 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:28,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:28,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:03:28,791 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:28,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:03:28,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:28,792 INFO L87 Difference]: Start difference. First operand 10501 states and 15619 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)