./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_15-2.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_15-2.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 ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 00:02:25,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 00:02:25,578 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 00:02:25,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 00:02:25,600 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 00:02:25,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 00:02:25,602 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 00:02:25,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 00:02:25,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 00:02:25,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 00:02:25,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 00:02:25,607 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 00:02:25,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 00:02:25,608 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 00:02:25,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 00:02:25,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 00:02:25,611 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 00:02:25,611 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 00:02:25,612 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 00:02:25,614 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 00:02:25,616 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 00:02:25,617 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 00:02:25,618 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 00:02:25,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 00:02:25,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 00:02:25,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 00:02:25,622 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 00:02:25,623 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 00:02:25,623 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 00:02:25,624 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 00:02:25,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 00:02:25,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 00:02:25,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 00:02:25,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 00:02:25,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 00:02:25,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 00:02:25,628 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 00:02:25,628 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 00:02:25,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 00:02:25,629 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 00:02:25,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 00:02:25,630 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:25,664 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 00:02:25,664 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 00:02:25,665 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 00:02:25,665 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 00:02:25,667 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 00:02:25,667 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 00:02:25,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 00:02:25,668 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 00:02:25,669 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 00:02:25,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 00:02:25,670 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 00:02:25,670 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 00:02:25,670 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 00:02:25,670 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 00:02:25,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 00:02:25,671 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-21 00:02:25,671 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-21 00:02:25,671 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-21 00:02:25,671 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 00:02:25,671 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-21 00:02:25,672 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 00:02:25,672 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 00:02:25,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 00:02:25,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 00:02:25,673 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 00:02:25,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:25,673 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 00:02:25,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 00:02:25,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 00:02:25,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 00:02:25,674 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 -> ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 [2022-02-21 00:02:25,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 00:02:25,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 00:02:25,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 00:02:25,915 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 00:02:25,916 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 00:02:25,917 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-2.c [2022-02-21 00:02:25,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52215981e/0a281da937d3416fa20ff863c5883a55/FLAGef68cacb6 [2022-02-21 00:02:26,414 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 00:02:26,415 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c [2022-02-21 00:02:26,426 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52215981e/0a281da937d3416fa20ff863c5883a55/FLAGef68cacb6 [2022-02-21 00:02:26,439 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52215981e/0a281da937d3416fa20ff863c5883a55 [2022-02-21 00:02:26,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 00:02:26,443 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 00:02:26,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:26,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 00:02:26,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 00:02:26,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:26" (1/1) ... [2022-02-21 00:02:26,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17d00bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:26, skipping insertion in model container [2022-02-21 00:02:26,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:26" (1/1) ... [2022-02-21 00:02:26,457 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 00:02:26,474 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 00:02:26,676 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_15-2.c[5628,5641] [2022-02-21 00:02:26,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:26,688 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 00:02:26,719 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_15-2.c[5628,5641] [2022-02-21 00:02:26,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:26,747 INFO L208 MainTranslator]: Completed translation [2022-02-21 00:02:26,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:26 WrapperNode [2022-02-21 00:02:26,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:26,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:26,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 00:02:26,760 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 00:02:26,789 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:26" (1/1) ... [2022-02-21 00:02:26,817 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:26" (1/1) ... [2022-02-21 00:02:26,870 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 193 [2022-02-21 00:02:26,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:26,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 00:02:26,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 00:02:26,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 00:02:26,901 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:26" (1/1) ... [2022-02-21 00:02:26,902 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:26" (1/1) ... [2022-02-21 00:02:26,913 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:26" (1/1) ... [2022-02-21 00:02:26,922 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:26" (1/1) ... [2022-02-21 00:02:26,927 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:26" (1/1) ... [2022-02-21 00:02:26,931 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:26" (1/1) ... [2022-02-21 00:02:26,954 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:26" (1/1) ... [2022-02-21 00:02:26,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 00:02:26,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 00:02:26,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 00:02:26,957 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 00:02:26,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:26" (1/1) ... [2022-02-21 00:02:26,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:26,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:27,000 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:27,021 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:27,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 00:02:27,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 00:02:27,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 00:02:27,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 00:02:27,106 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 00:02:27,107 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 00:02:27,416 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 00:02:27,424 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 00:02:27,424 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 00:02:27,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:27 BoogieIcfgContainer [2022-02-21 00:02:27,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 00:02:27,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 00:02:27,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 00:02:27,431 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 00:02:27,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 12:02:26" (1/3) ... [2022-02-21 00:02:27,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60962c73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:27, skipping insertion in model container [2022-02-21 00:02:27,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:26" (2/3) ... [2022-02-21 00:02:27,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60962c73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:27, skipping insertion in model container [2022-02-21 00:02:27,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:27" (3/3) ... [2022-02-21 00:02:27,434 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2022-02-21 00:02:27,438 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 00:02:27,439 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-21 00:02:27,483 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 00:02:27,489 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:27,490 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-21 00:02:27,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 55 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (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,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 00:02:27,510 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:27,510 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 00:02:27,511 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:27,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:27,515 INFO L85 PathProgramCache]: Analyzing trace with hash 28959891, now seen corresponding path program 1 times [2022-02-21 00:02:27,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:27,525 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118487869] [2022-02-21 00:02:27,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:27,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:27,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {59#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); {59#true} is VALID [2022-02-21 00:02:27,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {59#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; {59#true} is VALID [2022-02-21 00:02:27,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {59#true} assume !true; {60#false} is VALID [2022-02-21 00:02:27,668 INFO L290 TraceCheckUtils]: 3: Hoare triple {60#false} main_#res#1 := 0; {60#false} is VALID [2022-02-21 00:02:27,668 INFO L290 TraceCheckUtils]: 4: Hoare triple {60#false} assume !(#valid == main_old_#valid#1); {60#false} is VALID [2022-02-21 00:02:27,669 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,670 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:27,670 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118487869] [2022-02-21 00:02:27,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118487869] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:27,671 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:27,672 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:27,673 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809364278] [2022-02-21 00:02:27,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:27,678 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:27,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:27,681 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:27,688 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:27,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-21 00:02:27,689 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:27,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 00:02:27,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 00:02:27,709 INFO L87 Difference]: Start difference. First operand has 56 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 55 states have internal predecessors, (103), 0 states have call successors, (0), 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:27,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:27,770 INFO L93 Difference]: Finished difference Result 56 states and 100 transitions. [2022-02-21 00:02:27,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 00:02:27,771 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:27,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:27,772 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:27,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 103 transitions. [2022-02-21 00:02:27,780 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:27,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 103 transitions. [2022-02-21 00:02:27,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 103 transitions. [2022-02-21 00:02:27,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:27,913 INFO L225 Difference]: With dead ends: 56 [2022-02-21 00:02:27,913 INFO L226 Difference]: Without dead ends: 54 [2022-02-21 00:02:27,915 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:27,918 INFO L933 BasicCegarLoop]: 100 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, 100 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:27,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 100 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:27,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-21 00:02:27,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-02-21 00:02:27,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:27,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 53 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (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,955 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 53 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (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,958 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 53 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (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,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:27,971 INFO L93 Difference]: Finished difference Result 54 states and 98 transitions. [2022-02-21 00:02:27,972 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 98 transitions. [2022-02-21 00:02:27,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:27,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:27,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 53 states have internal predecessors, (98), 0 states have call successors, (0), 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 54 states. [2022-02-21 00:02:27,974 INFO L87 Difference]: Start difference. First operand has 54 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 53 states have internal predecessors, (98), 0 states have call successors, (0), 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 54 states. [2022-02-21 00:02:27,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:27,981 INFO L93 Difference]: Finished difference Result 54 states and 98 transitions. [2022-02-21 00:02:27,982 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 98 transitions. [2022-02-21 00:02:27,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:27,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:27,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:27,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:27,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 53 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (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,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 98 transitions. [2022-02-21 00:02:27,991 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 98 transitions. Word has length 5 [2022-02-21 00:02:27,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:27,991 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 98 transitions. [2022-02-21 00:02:27,991 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:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 98 transitions. [2022-02-21 00:02:27,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 00:02:27,993 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:27,993 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 00:02:27,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 00:02:27,995 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:27,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:27,998 INFO L85 PathProgramCache]: Analyzing trace with hash 889700683, now seen corresponding path program 1 times [2022-02-21 00:02:27,999 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:27,999 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387461835] [2022-02-21 00:02:27,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:27,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:28,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {281#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); {281#true} is VALID [2022-02-21 00:02:28,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {281#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; {283#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:28,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {283#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !false;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {283#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:28,092 INFO L290 TraceCheckUtils]: 3: Hoare triple {283#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume 0 == main_~cond~0#1; {283#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:28,094 INFO L290 TraceCheckUtils]: 4: Hoare triple {283#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} main_#res#1 := 0; {283#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:28,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {283#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {282#false} is VALID [2022-02-21 00:02:28,098 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,098 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:28,099 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387461835] [2022-02-21 00:02:28,100 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387461835] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:28,100 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:28,101 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:28,101 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428992513] [2022-02-21 00:02:28,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:28,110 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:28,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:28,115 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:28,122 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:28,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:28,123 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:28,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:28,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:28,125 INFO L87 Difference]: Start difference. First operand 54 states and 98 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:28,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:28,229 INFO L93 Difference]: Finished difference Result 53 states and 97 transitions. [2022-02-21 00:02:28,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:28,229 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:28,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:28,229 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:28,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2022-02-21 00:02:28,232 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:28,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2022-02-21 00:02:28,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2022-02-21 00:02:28,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:28,314 INFO L225 Difference]: With dead ends: 53 [2022-02-21 00:02:28,314 INFO L226 Difference]: Without dead ends: 51 [2022-02-21 00:02:28,315 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:28,316 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 97 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:28,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 97 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:28,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-21 00:02:28,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-02-21 00:02:28,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:28,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (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,322 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (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,322 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (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,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:28,325 INFO L93 Difference]: Finished difference Result 51 states and 95 transitions. [2022-02-21 00:02:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 95 transitions. [2022-02-21 00:02:28,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:28,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:28,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 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:28,326 INFO L87 Difference]: Start difference. First operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 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:28,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:28,329 INFO L93 Difference]: Finished difference Result 51 states and 95 transitions. [2022-02-21 00:02:28,329 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 95 transitions. [2022-02-21 00:02:28,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:28,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:28,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:28,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:28,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (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,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 95 transitions. [2022-02-21 00:02:28,332 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 95 transitions. Word has length 6 [2022-02-21 00:02:28,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:28,333 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 95 transitions. [2022-02-21 00:02:28,333 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:28,333 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 95 transitions. [2022-02-21 00:02:28,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-21 00:02:28,334 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:28,334 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:28,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 00:02:28,335 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:28,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:28,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1188560455, now seen corresponding path program 1 times [2022-02-21 00:02:28,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:28,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328923843] [2022-02-21 00:02:28,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:28,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:28,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {492#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); {492#true} is VALID [2022-02-21 00:02:28,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {492#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; {492#true} is VALID [2022-02-21 00:02:28,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {492#true} assume !false;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {492#true} is VALID [2022-02-21 00:02:28,444 INFO L290 TraceCheckUtils]: 3: Hoare triple {492#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;main_~lk15~0#1 := 0; {492#true} is VALID [2022-02-21 00:02:28,445 INFO L290 TraceCheckUtils]: 4: Hoare triple {492#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:28,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:28,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume !(0 != main_~p3~0#1); {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:28,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:28,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:28,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:28,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:28,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:28,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:28,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:28,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume !(0 != main_~p11~0#1); {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:28,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:28,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:28,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:28,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:28,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p1~0#1; {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:28,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {494#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 1 != main_~lk1~0#1; {493#false} is VALID [2022-02-21 00:02:28,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {493#false} assume !false; {493#false} is VALID [2022-02-21 00:02:28,453 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,453 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:28,454 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328923843] [2022-02-21 00:02:28,454 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328923843] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:28,454 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:28,454 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:28,455 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993232702] [2022-02-21 00:02:28,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:28,455 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:28,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:28,456 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:28,475 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:28,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:28,476 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:28,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:28,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:28,477 INFO L87 Difference]: Start difference. First operand 51 states and 95 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:28,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:28,635 INFO L93 Difference]: Finished difference Result 99 states and 185 transitions. [2022-02-21 00:02:28,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:28,636 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:28,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:28,636 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:28,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2022-02-21 00:02:28,638 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:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2022-02-21 00:02:28,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 186 transitions. [2022-02-21 00:02:28,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:28,837 INFO L225 Difference]: With dead ends: 99 [2022-02-21 00:02:28,837 INFO L226 Difference]: Without dead ends: 99 [2022-02-21 00:02:28,838 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,839 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 73 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 187 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,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 187 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,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-02-21 00:02:28,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 67. [2022-02-21 00:02:28,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:28,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 67 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 66 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (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,845 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 67 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 66 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (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,845 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 67 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 66 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (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,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:28,863 INFO L93 Difference]: Finished difference Result 99 states and 185 transitions. [2022-02-21 00:02:28,863 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 185 transitions. [2022-02-21 00:02:28,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:28,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:28,865 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 66 states have internal predecessors, (126), 0 states have call successors, (0), 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 99 states. [2022-02-21 00:02:28,865 INFO L87 Difference]: Start difference. First operand has 67 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 66 states have internal predecessors, (126), 0 states have call successors, (0), 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 99 states. [2022-02-21 00:02:28,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:28,869 INFO L93 Difference]: Finished difference Result 99 states and 185 transitions. [2022-02-21 00:02:28,869 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 185 transitions. [2022-02-21 00:02:28,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:28,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:28,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:28,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:28,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 66 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (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,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 126 transitions. [2022-02-21 00:02:28,873 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 126 transitions. Word has length 22 [2022-02-21 00:02:28,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:28,873 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 126 transitions. [2022-02-21 00:02:28,873 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:28,874 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 126 transitions. [2022-02-21 00:02:28,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-21 00:02:28,874 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:28,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] [2022-02-21 00:02:28,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 00:02:28,875 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:28,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:28,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1112262135, now seen corresponding path program 1 times [2022-02-21 00:02:28,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:28,876 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204760067] [2022-02-21 00:02:28,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:28,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:28,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {861#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); {861#true} is VALID [2022-02-21 00:02:28,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {861#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; {861#true} is VALID [2022-02-21 00:02:28,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {861#true} assume !false;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {861#true} is VALID [2022-02-21 00:02:28,980 INFO L290 TraceCheckUtils]: 3: Hoare triple {861#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;main_~lk15~0#1 := 0; {861#true} is VALID [2022-02-21 00:02:28,981 INFO L290 TraceCheckUtils]: 4: Hoare triple {861#true} assume !(0 != main_~p1~0#1); {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:28,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:28,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume !(0 != main_~p3~0#1); {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:28,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:28,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:28,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:28,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:28,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:28,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:28,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:28,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume !(0 != main_~p11~0#1); {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:28,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:28,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:28,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:28,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:28,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {863#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p1~0#1; {862#false} is VALID [2022-02-21 00:02:28,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {862#false} assume 1 != main_~lk1~0#1; {862#false} is VALID [2022-02-21 00:02:28,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {862#false} assume !false; {862#false} is VALID [2022-02-21 00:02:28,988 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,988 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:28,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204760067] [2022-02-21 00:02:28,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204760067] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:28,989 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:28,989 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:28,989 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110500877] [2022-02-21 00:02:28,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:28,990 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:28,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:28,990 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:29,022 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:29,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:29,023 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:29,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:29,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:29,024 INFO L87 Difference]: Start difference. First operand 67 states and 126 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:29,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:29,150 INFO L93 Difference]: Finished difference Result 99 states and 183 transitions. [2022-02-21 00:02:29,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:29,150 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:29,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:29,150 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:29,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2022-02-21 00:02:29,152 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:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2022-02-21 00:02:29,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 185 transitions. [2022-02-21 00:02:29,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:29,295 INFO L225 Difference]: With dead ends: 99 [2022-02-21 00:02:29,295 INFO L226 Difference]: Without dead ends: 99 [2022-02-21 00:02:29,295 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,296 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 73 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 213 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:29,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 213 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:29,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-02-21 00:02:29,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2022-02-21 00:02:29,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:29,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 97 states, 96 states have (on average 1.8958333333333333) internal successors, (182), 96 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (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,305 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 97 states, 96 states have (on average 1.8958333333333333) internal successors, (182), 96 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (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,306 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 97 states, 96 states have (on average 1.8958333333333333) internal successors, (182), 96 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (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,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:29,322 INFO L93 Difference]: Finished difference Result 99 states and 183 transitions. [2022-02-21 00:02:29,322 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 183 transitions. [2022-02-21 00:02:29,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:29,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:29,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 96 states have (on average 1.8958333333333333) internal successors, (182), 96 states have internal predecessors, (182), 0 states have call successors, (0), 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 99 states. [2022-02-21 00:02:29,323 INFO L87 Difference]: Start difference. First operand has 97 states, 96 states have (on average 1.8958333333333333) internal successors, (182), 96 states have internal predecessors, (182), 0 states have call successors, (0), 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 99 states. [2022-02-21 00:02:29,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:29,327 INFO L93 Difference]: Finished difference Result 99 states and 183 transitions. [2022-02-21 00:02:29,327 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 183 transitions. [2022-02-21 00:02:29,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:29,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:29,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:29,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:29,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.8958333333333333) internal successors, (182), 96 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (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,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 182 transitions. [2022-02-21 00:02:29,332 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 182 transitions. Word has length 22 [2022-02-21 00:02:29,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:29,332 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 182 transitions. [2022-02-21 00:02:29,332 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:29,332 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 182 transitions. [2022-02-21 00:02:29,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-21 00:02:29,335 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:29,335 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:29,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 00:02:29,336 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:29,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:29,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1809543287, now seen corresponding path program 1 times [2022-02-21 00:02:29,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:29,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894500801] [2022-02-21 00:02:29,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:29,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:29,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {1260#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); {1260#true} is VALID [2022-02-21 00:02:29,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {1260#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; {1260#true} is VALID [2022-02-21 00:02:29,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {1260#true} assume !false;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {1260#true} is VALID [2022-02-21 00:02:29,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {1260#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;main_~lk15~0#1 := 0; {1260#true} is VALID [2022-02-21 00:02:29,389 INFO L290 TraceCheckUtils]: 4: Hoare triple {1260#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:29,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:29,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p3~0#1); {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:29,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:29,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:29,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:29,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:29,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:29,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:29,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:29,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p11~0#1); {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:29,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:29,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:29,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:29,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:29,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {1262#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p1~0#1); {1261#false} is VALID [2022-02-21 00:02:29,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {1261#false} assume 0 != main_~p2~0#1; {1261#false} is VALID [2022-02-21 00:02:29,396 INFO L290 TraceCheckUtils]: 21: Hoare triple {1261#false} assume 1 != main_~lk2~0#1; {1261#false} is VALID [2022-02-21 00:02:29,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2022-02-21 00:02:29,397 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,397 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:29,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894500801] [2022-02-21 00:02:29,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894500801] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:29,398 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:29,398 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:29,398 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763198163] [2022-02-21 00:02:29,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:29,399 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:29,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:29,416 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:29,431 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:29,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:29,432 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:29,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:29,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:29,433 INFO L87 Difference]: Start difference. First operand 97 states and 182 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:29,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:29,571 INFO L93 Difference]: Finished difference Result 102 states and 185 transitions. [2022-02-21 00:02:29,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:29,571 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:29,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:29,571 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:29,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 184 transitions. [2022-02-21 00:02:29,574 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:29,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 184 transitions. [2022-02-21 00:02:29,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 184 transitions. [2022-02-21 00:02:29,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:29,720 INFO L225 Difference]: With dead ends: 102 [2022-02-21 00:02:29,720 INFO L226 Difference]: Without dead ends: 102 [2022-02-21 00:02:29,720 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,721 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 75 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 240 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,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 240 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,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-21 00:02:29,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2022-02-21 00:02:29,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:29,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 100 states, 99 states have (on average 1.8585858585858586) internal successors, (184), 99 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (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,726 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 100 states, 99 states have (on average 1.8585858585858586) internal successors, (184), 99 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (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,727 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 100 states, 99 states have (on average 1.8585858585858586) internal successors, (184), 99 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (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,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:29,730 INFO L93 Difference]: Finished difference Result 102 states and 185 transitions. [2022-02-21 00:02:29,730 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 185 transitions. [2022-02-21 00:02:29,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:29,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:29,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 99 states have (on average 1.8585858585858586) internal successors, (184), 99 states have internal predecessors, (184), 0 states have call successors, (0), 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 102 states. [2022-02-21 00:02:29,732 INFO L87 Difference]: Start difference. First operand has 100 states, 99 states have (on average 1.8585858585858586) internal successors, (184), 99 states have internal predecessors, (184), 0 states have call successors, (0), 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 102 states. [2022-02-21 00:02:29,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:29,735 INFO L93 Difference]: Finished difference Result 102 states and 185 transitions. [2022-02-21 00:02:29,735 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 185 transitions. [2022-02-21 00:02:29,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:29,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:29,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:29,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:29,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.8585858585858586) internal successors, (184), 99 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (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,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 184 transitions. [2022-02-21 00:02:29,739 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 184 transitions. Word has length 23 [2022-02-21 00:02:29,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:29,739 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 184 transitions. [2022-02-21 00:02:29,740 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:29,740 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 184 transitions. [2022-02-21 00:02:29,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-21 00:02:29,740 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:29,741 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:29,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 00:02:29,741 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:29,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:29,742 INFO L85 PathProgramCache]: Analyzing trace with hash 120599545, now seen corresponding path program 1 times [2022-02-21 00:02:29,742 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:29,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2637729] [2022-02-21 00:02:29,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:29,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:29,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {1671#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); {1671#true} is VALID [2022-02-21 00:02:29,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {1671#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; {1671#true} is VALID [2022-02-21 00:02:29,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {1671#true} assume !false;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {1671#true} is VALID [2022-02-21 00:02:29,785 INFO L290 TraceCheckUtils]: 3: Hoare triple {1671#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;main_~lk15~0#1 := 0; {1671#true} is VALID [2022-02-21 00:02:29,785 INFO L290 TraceCheckUtils]: 4: Hoare triple {1671#true} assume !(0 != main_~p1~0#1); {1671#true} is VALID [2022-02-21 00:02:29,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {1671#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:29,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p3~0#1); {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:29,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:29,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:29,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:29,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:29,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:29,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:29,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:29,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p11~0#1); {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:29,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:29,799 INFO L290 TraceCheckUtils]: 16: Hoare triple {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:29,799 INFO L290 TraceCheckUtils]: 17: Hoare triple {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:29,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:29,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p1~0#1); {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:29,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p2~0#1; {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:29,801 INFO L290 TraceCheckUtils]: 21: Hoare triple {1673#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 1 != main_~lk2~0#1; {1672#false} is VALID [2022-02-21 00:02:29,801 INFO L290 TraceCheckUtils]: 22: Hoare triple {1672#false} assume !false; {1672#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,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2637729] [2022-02-21 00:02:29,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2637729] 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,802 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064364674] [2022-02-21 00:02:29,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:29,803 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:29,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:29,803 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:29,831 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:29,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:29,832 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:29,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:29,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:29,833 INFO L87 Difference]: Start difference. First operand 100 states and 184 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:29,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:29,968 INFO L93 Difference]: Finished difference Result 191 states and 354 transitions. [2022-02-21 00:02:29,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:29,968 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:29,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:29,968 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:29,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2022-02-21 00:02:29,971 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:29,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2022-02-21 00:02:29,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 182 transitions. [2022-02-21 00:02:30,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:30,119 INFO L225 Difference]: With dead ends: 191 [2022-02-21 00:02:30,119 INFO L226 Difference]: Without dead ends: 191 [2022-02-21 00:02:30,120 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,121 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 70 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 185 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:30,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 185 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:30,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-02-21 00:02:30,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 133. [2022-02-21 00:02:30,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:30,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 133 states, 132 states have (on average 1.856060606060606) internal successors, (245), 132 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (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,141 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 133 states, 132 states have (on average 1.856060606060606) internal successors, (245), 132 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (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,142 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 133 states, 132 states have (on average 1.856060606060606) internal successors, (245), 132 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (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,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:30,146 INFO L93 Difference]: Finished difference Result 191 states and 354 transitions. [2022-02-21 00:02:30,146 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 354 transitions. [2022-02-21 00:02:30,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:30,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:30,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 132 states have (on average 1.856060606060606) internal successors, (245), 132 states have internal predecessors, (245), 0 states have call successors, (0), 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 191 states. [2022-02-21 00:02:30,148 INFO L87 Difference]: Start difference. First operand has 133 states, 132 states have (on average 1.856060606060606) internal successors, (245), 132 states have internal predecessors, (245), 0 states have call successors, (0), 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 191 states. [2022-02-21 00:02:30,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:30,167 INFO L93 Difference]: Finished difference Result 191 states and 354 transitions. [2022-02-21 00:02:30,167 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 354 transitions. [2022-02-21 00:02:30,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:30,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:30,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:30,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:30,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.856060606060606) internal successors, (245), 132 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (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,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 245 transitions. [2022-02-21 00:02:30,172 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 245 transitions. Word has length 23 [2022-02-21 00:02:30,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:30,173 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 245 transitions. [2022-02-21 00:02:30,173 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:30,173 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 245 transitions. [2022-02-21 00:02:30,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-21 00:02:30,174 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:30,174 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:30,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 00:02:30,174 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:30,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:30,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1873545161, now seen corresponding path program 1 times [2022-02-21 00:02:30,175 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:30,175 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060195805] [2022-02-21 00:02:30,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:30,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:30,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {2382#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); {2382#true} is VALID [2022-02-21 00:02:30,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {2382#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; {2382#true} is VALID [2022-02-21 00:02:30,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {2382#true} assume !false;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {2382#true} is VALID [2022-02-21 00:02:30,250 INFO L290 TraceCheckUtils]: 3: Hoare triple {2382#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;main_~lk15~0#1 := 0; {2382#true} is VALID [2022-02-21 00:02:30,250 INFO L290 TraceCheckUtils]: 4: Hoare triple {2382#true} assume !(0 != main_~p1~0#1); {2382#true} is VALID [2022-02-21 00:02:30,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {2382#true} assume !(0 != main_~p2~0#1); {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:30,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p3~0#1); {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:30,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:30,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:30,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:30,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:30,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:30,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:30,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:30,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p11~0#1); {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:30,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:30,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:30,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:30,255 INFO L290 TraceCheckUtils]: 18: Hoare triple {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:30,256 INFO L290 TraceCheckUtils]: 19: Hoare triple {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p1~0#1); {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:30,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {2384#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p2~0#1; {2383#false} is VALID [2022-02-21 00:02:30,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {2383#false} assume 1 != main_~lk2~0#1; {2383#false} is VALID [2022-02-21 00:02:30,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {2383#false} assume !false; {2383#false} is VALID [2022-02-21 00:02:30,257 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,257 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:30,257 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060195805] [2022-02-21 00:02:30,257 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060195805] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:30,257 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:30,257 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:30,258 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927836715] [2022-02-21 00:02:30,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:30,258 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:30,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:30,263 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:30,291 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:30,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:30,291 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:30,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:30,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:30,292 INFO L87 Difference]: Start difference. First operand 133 states and 245 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:30,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:30,434 INFO L93 Difference]: Finished difference Result 193 states and 352 transitions. [2022-02-21 00:02:30,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:30,434 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:30,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:30,434 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:30,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2022-02-21 00:02:30,436 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:30,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2022-02-21 00:02:30,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 183 transitions. [2022-02-21 00:02:30,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:30,600 INFO L225 Difference]: With dead ends: 193 [2022-02-21 00:02:30,600 INFO L226 Difference]: Without dead ends: 193 [2022-02-21 00:02:30,601 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,602 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 72 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 214 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,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 214 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,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-02-21 00:02:30,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2022-02-21 00:02:30,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:30,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 191 states, 190 states have (on average 1.8473684210526315) internal successors, (351), 190 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (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,610 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 191 states, 190 states have (on average 1.8473684210526315) internal successors, (351), 190 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (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,611 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 191 states, 190 states have (on average 1.8473684210526315) internal successors, (351), 190 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (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,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:30,615 INFO L93 Difference]: Finished difference Result 193 states and 352 transitions. [2022-02-21 00:02:30,615 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 352 transitions. [2022-02-21 00:02:30,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:30,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:30,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 191 states, 190 states have (on average 1.8473684210526315) internal successors, (351), 190 states have internal predecessors, (351), 0 states have call successors, (0), 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 193 states. [2022-02-21 00:02:30,616 INFO L87 Difference]: Start difference. First operand has 191 states, 190 states have (on average 1.8473684210526315) internal successors, (351), 190 states have internal predecessors, (351), 0 states have call successors, (0), 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 193 states. [2022-02-21 00:02:30,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:30,622 INFO L93 Difference]: Finished difference Result 193 states and 352 transitions. [2022-02-21 00:02:30,622 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 352 transitions. [2022-02-21 00:02:30,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:30,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:30,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:30,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:30,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 1.8473684210526315) internal successors, (351), 190 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (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,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 351 transitions. [2022-02-21 00:02:30,628 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 351 transitions. Word has length 23 [2022-02-21 00:02:30,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:30,628 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 351 transitions. [2022-02-21 00:02:30,629 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:30,629 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 351 transitions. [2022-02-21 00:02:30,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-21 00:02:30,629 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:30,629 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:30,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-21 00:02:30,630 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:30,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:30,630 INFO L85 PathProgramCache]: Analyzing trace with hash -556169332, now seen corresponding path program 1 times [2022-02-21 00:02:30,630 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:30,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195687170] [2022-02-21 00:02:30,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:30,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:30,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {3157#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); {3157#true} is VALID [2022-02-21 00:02:30,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {3157#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; {3157#true} is VALID [2022-02-21 00:02:30,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {3157#true} assume !false;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {3157#true} is VALID [2022-02-21 00:02:30,686 INFO L290 TraceCheckUtils]: 3: Hoare triple {3157#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;main_~lk15~0#1 := 0; {3157#true} is VALID [2022-02-21 00:02:30,686 INFO L290 TraceCheckUtils]: 4: Hoare triple {3157#true} assume !(0 != main_~p1~0#1); {3157#true} is VALID [2022-02-21 00:02:30,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {3157#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:30,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p3~0#1); {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:30,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:30,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:30,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:30,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:30,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:30,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:30,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:30,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p11~0#1); {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:30,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:30,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:30,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:30,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:30,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p1~0#1); {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:30,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {3159#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p2~0#1); {3158#false} is VALID [2022-02-21 00:02:30,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {3158#false} assume 0 != main_~p3~0#1; {3158#false} is VALID [2022-02-21 00:02:30,693 INFO L290 TraceCheckUtils]: 22: Hoare triple {3158#false} assume 1 != main_~lk3~0#1; {3158#false} is VALID [2022-02-21 00:02:30,693 INFO L290 TraceCheckUtils]: 23: Hoare triple {3158#false} assume !false; {3158#false} is VALID [2022-02-21 00:02:30,693 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,693 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:30,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195687170] [2022-02-21 00:02:30,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195687170] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:30,694 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:30,694 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:30,694 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965298960] [2022-02-21 00:02:30,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:30,695 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:30,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:30,695 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:30,711 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:30,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:30,712 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:30,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:30,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:30,712 INFO L87 Difference]: Start difference. First operand 191 states and 351 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:30,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:30,832 INFO L93 Difference]: Finished difference Result 195 states and 352 transitions. [2022-02-21 00:02:30,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:30,833 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:30,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:30,833 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:30,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2022-02-21 00:02:30,835 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:30,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2022-02-21 00:02:30,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 182 transitions. [2022-02-21 00:02:30,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:30,959 INFO L225 Difference]: With dead ends: 195 [2022-02-21 00:02:30,959 INFO L226 Difference]: Without dead ends: 195 [2022-02-21 00:02:30,959 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,960 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 74 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 236 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,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 236 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,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-02-21 00:02:30,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2022-02-21 00:02:30,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:30,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 195 states. Second operand has 193 states, 192 states have (on average 1.828125) internal successors, (351), 192 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:30,967 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand has 193 states, 192 states have (on average 1.828125) internal successors, (351), 192 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:30,967 INFO L87 Difference]: Start difference. First operand 195 states. Second operand has 193 states, 192 states have (on average 1.828125) internal successors, (351), 192 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (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,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:30,972 INFO L93 Difference]: Finished difference Result 195 states and 352 transitions. [2022-02-21 00:02:30,972 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 352 transitions. [2022-02-21 00:02:30,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:30,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:30,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 192 states have (on average 1.828125) internal successors, (351), 192 states have internal predecessors, (351), 0 states have call successors, (0), 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 195 states. [2022-02-21 00:02:30,974 INFO L87 Difference]: Start difference. First operand has 193 states, 192 states have (on average 1.828125) internal successors, (351), 192 states have internal predecessors, (351), 0 states have call successors, (0), 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 195 states. [2022-02-21 00:02:30,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:30,979 INFO L93 Difference]: Finished difference Result 195 states and 352 transitions. [2022-02-21 00:02:30,979 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 352 transitions. [2022-02-21 00:02:30,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:30,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:30,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:30,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.828125) internal successors, (351), 192 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (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,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 351 transitions. [2022-02-21 00:02:30,984 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 351 transitions. Word has length 24 [2022-02-21 00:02:30,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:30,985 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 351 transitions. [2022-02-21 00:02:30,985 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:30,985 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 351 transitions. [2022-02-21 00:02:30,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-21 00:02:30,985 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:30,986 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:30,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-21 00:02:30,986 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:30,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:30,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2049854222, now seen corresponding path program 1 times [2022-02-21 00:02:30,987 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:30,987 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125520373] [2022-02-21 00:02:30,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:30,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:31,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {3940#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); {3940#true} is VALID [2022-02-21 00:02:31,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {3940#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; {3940#true} is VALID [2022-02-21 00:02:31,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {3940#true} assume !false;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {3940#true} is VALID [2022-02-21 00:02:31,021 INFO L290 TraceCheckUtils]: 3: Hoare triple {3940#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;main_~lk15~0#1 := 0; {3940#true} is VALID [2022-02-21 00:02:31,021 INFO L290 TraceCheckUtils]: 4: Hoare triple {3940#true} assume !(0 != main_~p1~0#1); {3940#true} is VALID [2022-02-21 00:02:31,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {3940#true} assume !(0 != main_~p2~0#1); {3940#true} is VALID [2022-02-21 00:02:31,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {3940#true} assume !(0 != main_~p3~0#1); {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:31,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:31,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:31,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:31,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:31,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:31,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:31,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:31,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p11~0#1); {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:31,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:31,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:31,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:31,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:31,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p1~0#1); {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:31,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p2~0#1); {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:31,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {3942#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p3~0#1; {3941#false} is VALID [2022-02-21 00:02:31,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {3941#false} assume 1 != main_~lk3~0#1; {3941#false} is VALID [2022-02-21 00:02:31,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {3941#false} assume !false; {3941#false} is VALID [2022-02-21 00:02:31,028 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,028 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:31,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125520373] [2022-02-21 00:02:31,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125520373] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:31,029 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:31,029 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:31,029 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216461361] [2022-02-21 00:02:31,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:31,030 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:31,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:31,030 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:31,046 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:31,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:31,046 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:31,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:31,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:31,047 INFO L87 Difference]: Start difference. First operand 193 states and 351 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:31,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:31,152 INFO L93 Difference]: Finished difference Result 375 states and 676 transitions. [2022-02-21 00:02:31,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:31,152 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:31,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:31,152 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:31,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2022-02-21 00:02:31,154 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:31,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2022-02-21 00:02:31,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 182 transitions. [2022-02-21 00:02:31,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:31,284 INFO L225 Difference]: With dead ends: 375 [2022-02-21 00:02:31,284 INFO L226 Difference]: Without dead ends: 375 [2022-02-21 00:02:31,284 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,285 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 72 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 187 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:31,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 187 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:31,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-02-21 00:02:31,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2022-02-21 00:02:31,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:31,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 375 states. Second operand has 373 states, 372 states have (on average 1.814516129032258) internal successors, (675), 372 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (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,304 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand has 373 states, 372 states have (on average 1.814516129032258) internal successors, (675), 372 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (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,305 INFO L87 Difference]: Start difference. First operand 375 states. Second operand has 373 states, 372 states have (on average 1.814516129032258) internal successors, (675), 372 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (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,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:31,313 INFO L93 Difference]: Finished difference Result 375 states and 676 transitions. [2022-02-21 00:02:31,313 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 676 transitions. [2022-02-21 00:02:31,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:31,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:31,314 INFO L74 IsIncluded]: Start isIncluded. First operand has 373 states, 372 states have (on average 1.814516129032258) internal successors, (675), 372 states have internal predecessors, (675), 0 states have call successors, (0), 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 375 states. [2022-02-21 00:02:31,315 INFO L87 Difference]: Start difference. First operand has 373 states, 372 states have (on average 1.814516129032258) internal successors, (675), 372 states have internal predecessors, (675), 0 states have call successors, (0), 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 375 states. [2022-02-21 00:02:31,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:31,323 INFO L93 Difference]: Finished difference Result 375 states and 676 transitions. [2022-02-21 00:02:31,324 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 676 transitions. [2022-02-21 00:02:31,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:31,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:31,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:31,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:31,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 1.814516129032258) internal successors, (675), 372 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (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,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 675 transitions. [2022-02-21 00:02:31,333 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 675 transitions. Word has length 24 [2022-02-21 00:02:31,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:31,334 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 675 transitions. [2022-02-21 00:02:31,334 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:31,334 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 675 transitions. [2022-02-21 00:02:31,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-21 00:02:31,335 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:31,335 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:31,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-21 00:02:31,335 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:31,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:31,336 INFO L85 PathProgramCache]: Analyzing trace with hash -250968368, now seen corresponding path program 1 times [2022-02-21 00:02:31,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:31,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31087301] [2022-02-21 00:02:31,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:31,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:31,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {5443#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); {5443#true} is VALID [2022-02-21 00:02:31,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {5443#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; {5443#true} is VALID [2022-02-21 00:02:31,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {5443#true} assume !false;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {5443#true} is VALID [2022-02-21 00:02:31,391 INFO L290 TraceCheckUtils]: 3: Hoare triple {5443#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;main_~lk15~0#1 := 0; {5443#true} is VALID [2022-02-21 00:02:31,392 INFO L290 TraceCheckUtils]: 4: Hoare triple {5443#true} assume !(0 != main_~p1~0#1); {5443#true} is VALID [2022-02-21 00:02:31,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {5443#true} assume !(0 != main_~p2~0#1); {5443#true} is VALID [2022-02-21 00:02:31,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {5443#true} assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:31,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:31,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:31,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:31,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:31,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:31,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:31,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:31,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p11~0#1); {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:31,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:31,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:31,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:31,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:31,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p1~0#1); {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:31,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p2~0#1); {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:31,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p3~0#1; {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:31,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {5445#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 1 != main_~lk3~0#1; {5444#false} is VALID [2022-02-21 00:02:31,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {5444#false} assume !false; {5444#false} is VALID [2022-02-21 00:02:31,404 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,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:31,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31087301] [2022-02-21 00:02:31,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31087301] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:31,404 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:31,404 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:31,404 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615987610] [2022-02-21 00:02:31,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:31,405 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:31,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:31,407 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:31,423 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:31,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:31,424 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:31,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:31,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:31,424 INFO L87 Difference]: Start difference. First operand 373 states and 675 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:31,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:31,566 INFO L93 Difference]: Finished difference Result 479 states and 872 transitions. [2022-02-21 00:02:31,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:31,566 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:31,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:31,567 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:31,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2022-02-21 00:02:31,568 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:31,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2022-02-21 00:02:31,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 175 transitions. [2022-02-21 00:02:31,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:31,717 INFO L225 Difference]: With dead ends: 479 [2022-02-21 00:02:31,717 INFO L226 Difference]: Without dead ends: 479 [2022-02-21 00:02:31,717 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,718 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 67 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 260 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:31,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 260 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:31,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-02-21 00:02:31,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 373. [2022-02-21 00:02:31,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:31,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 479 states. Second operand has 373 states, 372 states have (on average 1.803763440860215) internal successors, (671), 372 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:31,732 INFO L74 IsIncluded]: Start isIncluded. First operand 479 states. Second operand has 373 states, 372 states have (on average 1.803763440860215) internal successors, (671), 372 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:31,733 INFO L87 Difference]: Start difference. First operand 479 states. Second operand has 373 states, 372 states have (on average 1.803763440860215) internal successors, (671), 372 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:31,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:31,745 INFO L93 Difference]: Finished difference Result 479 states and 872 transitions. [2022-02-21 00:02:31,746 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 872 transitions. [2022-02-21 00:02:31,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:31,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:31,747 INFO L74 IsIncluded]: Start isIncluded. First operand has 373 states, 372 states have (on average 1.803763440860215) internal successors, (671), 372 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 479 states. [2022-02-21 00:02:31,748 INFO L87 Difference]: Start difference. First operand has 373 states, 372 states have (on average 1.803763440860215) internal successors, (671), 372 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 479 states. [2022-02-21 00:02:31,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:31,762 INFO L93 Difference]: Finished difference Result 479 states and 872 transitions. [2022-02-21 00:02:31,762 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 872 transitions. [2022-02-21 00:02:31,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:31,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:31,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:31,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:31,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 1.803763440860215) internal successors, (671), 372 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:31,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 671 transitions. [2022-02-21 00:02:31,773 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 671 transitions. Word has length 24 [2022-02-21 00:02:31,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:31,773 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 671 transitions. [2022-02-21 00:02:31,773 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:31,774 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 671 transitions. [2022-02-21 00:02:31,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-21 00:02:31,774 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:31,774 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:31,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-21 00:02:31,775 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:31,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:31,776 INFO L85 PathProgramCache]: Analyzing trace with hash -878816148, now seen corresponding path program 1 times [2022-02-21 00:02:31,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:31,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208867303] [2022-02-21 00:02:31,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:31,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:31,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {7258#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); {7258#true} is VALID [2022-02-21 00:02:31,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {7258#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; {7258#true} is VALID [2022-02-21 00:02:31,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {7258#true} assume !false;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {7258#true} is VALID [2022-02-21 00:02:31,815 INFO L290 TraceCheckUtils]: 3: Hoare triple {7258#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;main_~lk15~0#1 := 0; {7258#true} is VALID [2022-02-21 00:02:31,816 INFO L290 TraceCheckUtils]: 4: Hoare triple {7258#true} assume !(0 != main_~p1~0#1); {7258#true} is VALID [2022-02-21 00:02:31,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {7258#true} assume !(0 != main_~p2~0#1); {7258#true} is VALID [2022-02-21 00:02:31,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {7258#true} assume !(0 != main_~p3~0#1); {7258#true} is VALID [2022-02-21 00:02:31,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {7258#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:31,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:31,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:31,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:31,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:31,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:31,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:31,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p11~0#1); {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:31,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:31,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:31,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:31,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:31,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p1~0#1); {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:31,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p2~0#1); {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:31,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p3~0#1); {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:31,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p4~0#1; {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:31,823 INFO L290 TraceCheckUtils]: 23: Hoare triple {7260#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 1 != main_~lk4~0#1; {7259#false} is VALID [2022-02-21 00:02:31,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {7259#false} assume !false; {7259#false} is VALID [2022-02-21 00:02:31,823 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,823 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:31,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208867303] [2022-02-21 00:02:31,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208867303] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:31,824 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:31,824 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:31,824 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791422736] [2022-02-21 00:02:31,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:31,825 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:31,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:31,825 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:31,842 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:31,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:31,843 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:31,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:31,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:31,843 INFO L87 Difference]: Start difference. First operand 373 states and 671 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:31,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:31,957 INFO L93 Difference]: Finished difference Result 707 states and 1280 transitions. [2022-02-21 00:02:31,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:31,958 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:31,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:31,958 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:31,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2022-02-21 00:02:31,959 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:31,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2022-02-21 00:02:31,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 174 transitions. [2022-02-21 00:02:32,092 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:32,113 INFO L225 Difference]: With dead ends: 707 [2022-02-21 00:02:32,113 INFO L226 Difference]: Without dead ends: 707 [2022-02-21 00:02:32,113 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:32,114 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 64 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 181 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:32,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 181 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:32,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2022-02-21 00:02:32,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 513. [2022-02-21 00:02:32,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:32,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 707 states. Second operand has 513 states, 512 states have (on average 1.779296875) internal successors, (911), 512 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (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,125 INFO L74 IsIncluded]: Start isIncluded. First operand 707 states. Second operand has 513 states, 512 states have (on average 1.779296875) internal successors, (911), 512 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (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,126 INFO L87 Difference]: Start difference. First operand 707 states. Second operand has 513 states, 512 states have (on average 1.779296875) internal successors, (911), 512 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (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,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:32,148 INFO L93 Difference]: Finished difference Result 707 states and 1280 transitions. [2022-02-21 00:02:32,148 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1280 transitions. [2022-02-21 00:02:32,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:32,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:32,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 513 states, 512 states have (on average 1.779296875) internal successors, (911), 512 states have internal predecessors, (911), 0 states have call successors, (0), 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 707 states. [2022-02-21 00:02:32,152 INFO L87 Difference]: Start difference. First operand has 513 states, 512 states have (on average 1.779296875) internal successors, (911), 512 states have internal predecessors, (911), 0 states have call successors, (0), 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 707 states. [2022-02-21 00:02:32,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:32,178 INFO L93 Difference]: Finished difference Result 707 states and 1280 transitions. [2022-02-21 00:02:32,178 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1280 transitions. [2022-02-21 00:02:32,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:32,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:32,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:32,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:32,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 1.779296875) internal successors, (911), 512 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (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,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 911 transitions. [2022-02-21 00:02:32,190 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 911 transitions. Word has length 25 [2022-02-21 00:02:32,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:32,190 INFO L470 AbstractCegarLoop]: Abstraction has 513 states and 911 transitions. [2022-02-21 00:02:32,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:32,190 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 911 transitions. [2022-02-21 00:02:32,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-21 00:02:32,191 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:32,191 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:32,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-21 00:02:32,191 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:32,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:32,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1422006442, now seen corresponding path program 1 times [2022-02-21 00:02:32,192 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:32,192 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518809171] [2022-02-21 00:02:32,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:32,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:32,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {9897#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); {9897#true} is VALID [2022-02-21 00:02:32,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {9897#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; {9897#true} is VALID [2022-02-21 00:02:32,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {9897#true} assume !false;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {9897#true} is VALID [2022-02-21 00:02:32,224 INFO L290 TraceCheckUtils]: 3: Hoare triple {9897#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;main_~lk15~0#1 := 0; {9897#true} is VALID [2022-02-21 00:02:32,225 INFO L290 TraceCheckUtils]: 4: Hoare triple {9897#true} assume !(0 != main_~p1~0#1); {9897#true} is VALID [2022-02-21 00:02:32,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {9897#true} assume !(0 != main_~p2~0#1); {9897#true} is VALID [2022-02-21 00:02:32,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {9897#true} assume !(0 != main_~p3~0#1); {9897#true} is VALID [2022-02-21 00:02:32,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {9897#true} assume !(0 != main_~p4~0#1); {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:32,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:32,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:32,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:32,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:32,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:32,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:32,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p11~0#1); {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:32,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:32,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:32,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:32,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:32,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p1~0#1); {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:32,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p2~0#1); {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:32,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p3~0#1); {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:32,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {9899#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p4~0#1; {9898#false} is VALID [2022-02-21 00:02:32,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {9898#false} assume 1 != main_~lk4~0#1; {9898#false} is VALID [2022-02-21 00:02:32,231 INFO L290 TraceCheckUtils]: 24: Hoare triple {9898#false} assume !false; {9898#false} is VALID [2022-02-21 00:02:32,232 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,232 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:32,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518809171] [2022-02-21 00:02:32,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518809171] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:32,232 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:32,232 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:32,233 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127838733] [2022-02-21 00:02:32,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:32,233 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:32,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:32,233 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:32,250 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:32,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:32,250 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:32,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:32,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:32,251 INFO L87 Difference]: Start difference. First operand 513 states and 911 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:32,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:32,376 INFO L93 Difference]: Finished difference Result 731 states and 1292 transitions. [2022-02-21 00:02:32,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:32,376 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:32,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:32,377 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:32,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2022-02-21 00:02:32,378 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:32,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2022-02-21 00:02:32,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 179 transitions. [2022-02-21 00:02:32,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:32,543 INFO L225 Difference]: With dead ends: 731 [2022-02-21 00:02:32,543 INFO L226 Difference]: Without dead ends: 731 [2022-02-21 00:02:32,543 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:32,544 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 70 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 216 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:32,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 216 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:32,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2022-02-21 00:02:32,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 729. [2022-02-21 00:02:32,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:32,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 731 states. Second operand has 729 states, 728 states have (on average 1.7733516483516483) internal successors, (1291), 728 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (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,558 INFO L74 IsIncluded]: Start isIncluded. First operand 731 states. Second operand has 729 states, 728 states have (on average 1.7733516483516483) internal successors, (1291), 728 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (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,559 INFO L87 Difference]: Start difference. First operand 731 states. Second operand has 729 states, 728 states have (on average 1.7733516483516483) internal successors, (1291), 728 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (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,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:32,582 INFO L93 Difference]: Finished difference Result 731 states and 1292 transitions. [2022-02-21 00:02:32,582 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1292 transitions. [2022-02-21 00:02:32,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:32,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:32,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 729 states, 728 states have (on average 1.7733516483516483) internal successors, (1291), 728 states have internal predecessors, (1291), 0 states have call successors, (0), 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 731 states. [2022-02-21 00:02:32,586 INFO L87 Difference]: Start difference. First operand has 729 states, 728 states have (on average 1.7733516483516483) internal successors, (1291), 728 states have internal predecessors, (1291), 0 states have call successors, (0), 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 731 states. [2022-02-21 00:02:32,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:32,609 INFO L93 Difference]: Finished difference Result 731 states and 1292 transitions. [2022-02-21 00:02:32,610 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1292 transitions. [2022-02-21 00:02:32,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:32,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:32,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:32,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:32,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 728 states have (on average 1.7733516483516483) internal successors, (1291), 728 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (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,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1291 transitions. [2022-02-21 00:02:32,635 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1291 transitions. Word has length 25 [2022-02-21 00:02:32,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:32,636 INFO L470 AbstractCegarLoop]: Abstraction has 729 states and 1291 transitions. [2022-02-21 00:02:32,636 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:32,636 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1291 transitions. [2022-02-21 00:02:32,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-21 00:02:32,637 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:32,637 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,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-21 00:02:32,637 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:32,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:32,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1473284061, now seen corresponding path program 1 times [2022-02-21 00:02:32,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:32,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744212392] [2022-02-21 00:02:32,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:32,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:32,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {12824#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); {12824#true} is VALID [2022-02-21 00:02:32,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {12824#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; {12824#true} is VALID [2022-02-21 00:02:32,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {12824#true} assume !false;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {12824#true} is VALID [2022-02-21 00:02:32,667 INFO L290 TraceCheckUtils]: 3: Hoare triple {12824#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;main_~lk15~0#1 := 0; {12824#true} is VALID [2022-02-21 00:02:32,667 INFO L290 TraceCheckUtils]: 4: Hoare triple {12824#true} assume !(0 != main_~p1~0#1); {12824#true} is VALID [2022-02-21 00:02:32,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {12824#true} assume !(0 != main_~p2~0#1); {12824#true} is VALID [2022-02-21 00:02:32,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {12824#true} assume !(0 != main_~p3~0#1); {12824#true} is VALID [2022-02-21 00:02:32,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {12824#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:32,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:32,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:32,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:32,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:32,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:32,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:32,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p11~0#1); {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:32,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:32,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:32,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:32,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:32,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p1~0#1); {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:32,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p2~0#1); {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:32,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p3~0#1); {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:32,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {12826#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p4~0#1); {12825#false} is VALID [2022-02-21 00:02:32,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {12825#false} assume 0 != main_~p5~0#1; {12825#false} is VALID [2022-02-21 00:02:32,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {12825#false} assume 1 != main_~lk5~0#1; {12825#false} is VALID [2022-02-21 00:02:32,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {12825#false} assume !false; {12825#false} is VALID [2022-02-21 00:02:32,674 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,674 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:32,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744212392] [2022-02-21 00:02:32,674 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744212392] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:32,674 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:32,675 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:32,675 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001605292] [2022-02-21 00:02:32,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:32,675 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,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:32,676 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,691 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,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:32,692 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:32,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:32,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:32,693 INFO L87 Difference]: Start difference. First operand 729 states and 1291 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,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:32,821 INFO L93 Difference]: Finished difference Result 743 states and 1300 transitions. [2022-02-21 00:02:32,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:32,821 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,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:32,821 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,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 178 transitions. [2022-02-21 00:02:32,822 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,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 178 transitions. [2022-02-21 00:02:32,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 178 transitions. [2022-02-21 00:02:32,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:32,984 INFO L225 Difference]: With dead ends: 743 [2022-02-21 00:02:32,985 INFO L226 Difference]: Without dead ends: 743 [2022-02-21 00:02:32,985 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:32,985 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 72 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 228 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:32,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 228 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:32,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2022-02-21 00:02:33,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2022-02-21 00:02:33,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:33,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 743 states. Second operand has 741 states, 740 states have (on average 1.7554054054054054) internal successors, (1299), 740 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (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,005 INFO L74 IsIncluded]: Start isIncluded. First operand 743 states. Second operand has 741 states, 740 states have (on average 1.7554054054054054) internal successors, (1299), 740 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (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,006 INFO L87 Difference]: Start difference. First operand 743 states. Second operand has 741 states, 740 states have (on average 1.7554054054054054) internal successors, (1299), 740 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (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,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:33,024 INFO L93 Difference]: Finished difference Result 743 states and 1300 transitions. [2022-02-21 00:02:33,024 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1300 transitions. [2022-02-21 00:02:33,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:33,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:33,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 741 states, 740 states have (on average 1.7554054054054054) internal successors, (1299), 740 states have internal predecessors, (1299), 0 states have call successors, (0), 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 743 states. [2022-02-21 00:02:33,027 INFO L87 Difference]: Start difference. First operand has 741 states, 740 states have (on average 1.7554054054054054) internal successors, (1299), 740 states have internal predecessors, (1299), 0 states have call successors, (0), 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 743 states. [2022-02-21 00:02:33,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:33,046 INFO L93 Difference]: Finished difference Result 743 states and 1300 transitions. [2022-02-21 00:02:33,047 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1300 transitions. [2022-02-21 00:02:33,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:33,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:33,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:33,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 740 states have (on average 1.7554054054054054) internal successors, (1299), 740 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (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,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1299 transitions. [2022-02-21 00:02:33,065 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1299 transitions. Word has length 26 [2022-02-21 00:02:33,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:33,066 INFO L470 AbstractCegarLoop]: Abstraction has 741 states and 1299 transitions. [2022-02-21 00:02:33,066 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,066 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1299 transitions. [2022-02-21 00:02:33,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-21 00:02:33,067 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:33,067 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:33,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-21 00:02:33,067 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:33,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:33,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1132739493, now seen corresponding path program 1 times [2022-02-21 00:02:33,068 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:33,068 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585924374] [2022-02-21 00:02:33,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:33,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:33,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {15799#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); {15799#true} is VALID [2022-02-21 00:02:33,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {15799#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; {15799#true} is VALID [2022-02-21 00:02:33,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {15799#true} assume !false;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {15799#true} is VALID [2022-02-21 00:02:33,103 INFO L290 TraceCheckUtils]: 3: Hoare triple {15799#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;main_~lk15~0#1 := 0; {15799#true} is VALID [2022-02-21 00:02:33,103 INFO L290 TraceCheckUtils]: 4: Hoare triple {15799#true} assume !(0 != main_~p1~0#1); {15799#true} is VALID [2022-02-21 00:02:33,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {15799#true} assume !(0 != main_~p2~0#1); {15799#true} is VALID [2022-02-21 00:02:33,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {15799#true} assume !(0 != main_~p3~0#1); {15799#true} is VALID [2022-02-21 00:02:33,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {15799#true} assume !(0 != main_~p4~0#1); {15799#true} is VALID [2022-02-21 00:02:33,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {15799#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:33,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:33,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:33,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:33,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:33,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:33,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p11~0#1); {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:33,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:33,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:33,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:33,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:33,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p1~0#1); {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:33,108 INFO L290 TraceCheckUtils]: 20: Hoare triple {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p2~0#1); {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:33,108 INFO L290 TraceCheckUtils]: 21: Hoare triple {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p3~0#1); {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:33,109 INFO L290 TraceCheckUtils]: 22: Hoare triple {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p4~0#1); {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:33,109 INFO L290 TraceCheckUtils]: 23: Hoare triple {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p5~0#1; {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:33,109 INFO L290 TraceCheckUtils]: 24: Hoare triple {15801#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 1 != main_~lk5~0#1; {15800#false} is VALID [2022-02-21 00:02:33,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {15800#false} assume !false; {15800#false} is VALID [2022-02-21 00:02:33,110 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,110 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:33,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585924374] [2022-02-21 00:02:33,110 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585924374] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:33,110 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:33,110 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:33,110 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060550330] [2022-02-21 00:02:33,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:33,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-21 00:02:33,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:33,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:33,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:33,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:33,128 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:33,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:33,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:33,128 INFO L87 Difference]: Start difference. First operand 741 states and 1299 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:33,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:33,268 INFO L93 Difference]: Finished difference Result 1383 states and 2444 transitions. [2022-02-21 00:02:33,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:33,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-21 00:02:33,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:33,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:33,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2022-02-21 00:02:33,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:33,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2022-02-21 00:02:33,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 170 transitions. [2022-02-21 00:02:33,385 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:33,434 INFO L225 Difference]: With dead ends: 1383 [2022-02-21 00:02:33,434 INFO L226 Difference]: Without dead ends: 1383 [2022-02-21 00:02:33,434 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,435 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 61 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 179 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:33,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 179 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:33,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2022-02-21 00:02:33,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1029. [2022-02-21 00:02:33,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:33,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1383 states. Second operand has 1029 states, 1028 states have (on average 1.722762645914397) internal successors, (1771), 1028 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (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,448 INFO L74 IsIncluded]: Start isIncluded. First operand 1383 states. Second operand has 1029 states, 1028 states have (on average 1.722762645914397) internal successors, (1771), 1028 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (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,449 INFO L87 Difference]: Start difference. First operand 1383 states. Second operand has 1029 states, 1028 states have (on average 1.722762645914397) internal successors, (1771), 1028 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (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,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:33,498 INFO L93 Difference]: Finished difference Result 1383 states and 2444 transitions. [2022-02-21 00:02:33,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2444 transitions. [2022-02-21 00:02:33,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:33,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:33,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 1029 states, 1028 states have (on average 1.722762645914397) internal successors, (1771), 1028 states have internal predecessors, (1771), 0 states have call successors, (0), 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 1383 states. [2022-02-21 00:02:33,503 INFO L87 Difference]: Start difference. First operand has 1029 states, 1028 states have (on average 1.722762645914397) internal successors, (1771), 1028 states have internal predecessors, (1771), 0 states have call successors, (0), 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 1383 states. [2022-02-21 00:02:33,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:33,562 INFO L93 Difference]: Finished difference Result 1383 states and 2444 transitions. [2022-02-21 00:02:33,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2444 transitions. [2022-02-21 00:02:33,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:33,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:33,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:33,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:33,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 1028 states have (on average 1.722762645914397) internal successors, (1771), 1028 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (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,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1771 transitions. [2022-02-21 00:02:33,596 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1771 transitions. Word has length 26 [2022-02-21 00:02:33,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:33,597 INFO L470 AbstractCegarLoop]: Abstraction has 1029 states and 1771 transitions. [2022-02-21 00:02:33,597 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,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1771 transitions. [2022-02-21 00:02:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-21 00:02:33,598 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:33,598 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:33,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-21 00:02:33,598 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:33,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:33,599 INFO L85 PathProgramCache]: Analyzing trace with hash -861405213, now seen corresponding path program 1 times [2022-02-21 00:02:33,599 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:33,599 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639931624] [2022-02-21 00:02:33,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:33,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:33,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {20982#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); {20982#true} is VALID [2022-02-21 00:02:33,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {20982#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; {20982#true} is VALID [2022-02-21 00:02:33,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {20982#true} assume !false;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {20982#true} is VALID [2022-02-21 00:02:33,623 INFO L290 TraceCheckUtils]: 3: Hoare triple {20982#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;main_~lk15~0#1 := 0; {20982#true} is VALID [2022-02-21 00:02:33,623 INFO L290 TraceCheckUtils]: 4: Hoare triple {20982#true} assume !(0 != main_~p1~0#1); {20982#true} is VALID [2022-02-21 00:02:33,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {20982#true} assume !(0 != main_~p2~0#1); {20982#true} is VALID [2022-02-21 00:02:33,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {20982#true} assume !(0 != main_~p3~0#1); {20982#true} is VALID [2022-02-21 00:02:33,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {20982#true} assume !(0 != main_~p4~0#1); {20982#true} is VALID [2022-02-21 00:02:33,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {20982#true} assume !(0 != main_~p5~0#1); {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:33,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:33,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:33,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:33,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:33,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:33,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p11~0#1); {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:33,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:33,627 INFO L290 TraceCheckUtils]: 16: Hoare triple {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:33,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:33,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:33,628 INFO L290 TraceCheckUtils]: 19: Hoare triple {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p1~0#1); {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:33,628 INFO L290 TraceCheckUtils]: 20: Hoare triple {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p2~0#1); {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:33,628 INFO L290 TraceCheckUtils]: 21: Hoare triple {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p3~0#1); {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:33,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p4~0#1); {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:33,629 INFO L290 TraceCheckUtils]: 23: Hoare triple {20984#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p5~0#1; {20983#false} is VALID [2022-02-21 00:02:33,629 INFO L290 TraceCheckUtils]: 24: Hoare triple {20983#false} assume 1 != main_~lk5~0#1; {20983#false} is VALID [2022-02-21 00:02:33,629 INFO L290 TraceCheckUtils]: 25: Hoare triple {20983#false} assume !false; {20983#false} is VALID [2022-02-21 00:02:33,629 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,630 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:33,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639931624] [2022-02-21 00:02:33,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639931624] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:33,630 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:33,630 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:33,630 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629812861] [2022-02-21 00:02:33,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:33,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-21 00:02:33,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:33,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:33,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:33,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:33,647 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:33,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:33,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:33,647 INFO L87 Difference]: Start difference. First operand 1029 states and 1771 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:33,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:33,805 INFO L93 Difference]: Finished difference Result 1447 states and 2484 transitions. [2022-02-21 00:02:33,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:33,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-21 00:02:33,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:33,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:33,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2022-02-21 00:02:33,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:33,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2022-02-21 00:02:33,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 177 transitions. [2022-02-21 00:02:33,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:34,014 INFO L225 Difference]: With dead ends: 1447 [2022-02-21 00:02:34,014 INFO L226 Difference]: Without dead ends: 1447 [2022-02-21 00:02:34,015 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,015 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 69 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:34,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 217 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:34,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2022-02-21 00:02:34,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1445. [2022-02-21 00:02:34,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:34,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1447 states. Second operand has 1445 states, 1444 states have (on average 1.7195290858725762) internal successors, (2483), 1444 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (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,037 INFO L74 IsIncluded]: Start isIncluded. First operand 1447 states. Second operand has 1445 states, 1444 states have (on average 1.7195290858725762) internal successors, (2483), 1444 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (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,038 INFO L87 Difference]: Start difference. First operand 1447 states. Second operand has 1445 states, 1444 states have (on average 1.7195290858725762) internal successors, (2483), 1444 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (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,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:34,095 INFO L93 Difference]: Finished difference Result 1447 states and 2484 transitions. [2022-02-21 00:02:34,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2484 transitions. [2022-02-21 00:02:34,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:34,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:34,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 1445 states, 1444 states have (on average 1.7195290858725762) internal successors, (2483), 1444 states have internal predecessors, (2483), 0 states have call successors, (0), 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 1447 states. [2022-02-21 00:02:34,101 INFO L87 Difference]: Start difference. First operand has 1445 states, 1444 states have (on average 1.7195290858725762) internal successors, (2483), 1444 states have internal predecessors, (2483), 0 states have call successors, (0), 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 1447 states. [2022-02-21 00:02:34,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:34,155 INFO L93 Difference]: Finished difference Result 1447 states and 2484 transitions. [2022-02-21 00:02:34,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2484 transitions. [2022-02-21 00:02:34,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:34,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:34,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:34,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:34,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.7195290858725762) internal successors, (2483), 1444 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (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,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2483 transitions. [2022-02-21 00:02:34,216 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2483 transitions. Word has length 26 [2022-02-21 00:02:34,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:34,216 INFO L470 AbstractCegarLoop]: Abstraction has 1445 states and 2483 transitions. [2022-02-21 00:02:34,216 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:34,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2483 transitions. [2022-02-21 00:02:34,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-21 00:02:34,217 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:34,217 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:34,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-21 00:02:34,218 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:34,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:34,218 INFO L85 PathProgramCache]: Analyzing trace with hash 755399007, now seen corresponding path program 1 times [2022-02-21 00:02:34,218 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:34,218 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41864660] [2022-02-21 00:02:34,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:34,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:34,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {26773#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); {26773#true} is VALID [2022-02-21 00:02:34,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {26773#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; {26773#true} is VALID [2022-02-21 00:02:34,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {26773#true} assume !false;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {26773#true} is VALID [2022-02-21 00:02:34,241 INFO L290 TraceCheckUtils]: 3: Hoare triple {26773#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;main_~lk15~0#1 := 0; {26773#true} is VALID [2022-02-21 00:02:34,241 INFO L290 TraceCheckUtils]: 4: Hoare triple {26773#true} assume !(0 != main_~p1~0#1); {26773#true} is VALID [2022-02-21 00:02:34,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {26773#true} assume !(0 != main_~p2~0#1); {26773#true} is VALID [2022-02-21 00:02:34,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {26773#true} assume !(0 != main_~p3~0#1); {26773#true} is VALID [2022-02-21 00:02:34,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {26773#true} assume !(0 != main_~p4~0#1); {26773#true} is VALID [2022-02-21 00:02:34,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {26773#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:34,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:34,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:34,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:34,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:34,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:34,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p11~0#1); {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:34,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:34,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:34,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:34,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:34,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p1~0#1); {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:34,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p2~0#1); {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:34,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p3~0#1); {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:34,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p4~0#1); {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:34,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {26775#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p5~0#1); {26774#false} is VALID [2022-02-21 00:02:34,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {26774#false} assume 0 != main_~p6~0#1; {26774#false} is VALID [2022-02-21 00:02:34,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {26774#false} assume 1 != main_~lk6~0#1; {26774#false} is VALID [2022-02-21 00:02:34,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {26774#false} assume !false; {26774#false} is VALID [2022-02-21 00:02:34,249 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:34,249 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:34,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41864660] [2022-02-21 00:02:34,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41864660] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:34,251 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:34,251 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:34,251 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366861684] [2022-02-21 00:02:34,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:34,252 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,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:34,252 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:34,268 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:34,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:34,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:34,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:34,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:34,268 INFO L87 Difference]: Start difference. First operand 1445 states and 2483 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,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:34,417 INFO L93 Difference]: Finished difference Result 1463 states and 2484 transitions. [2022-02-21 00:02:34,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:34,418 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,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:34,418 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,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2022-02-21 00:02:34,419 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,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2022-02-21 00:02:34,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 176 transitions. [2022-02-21 00:02:34,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:34,605 INFO L225 Difference]: With dead ends: 1463 [2022-02-21 00:02:34,606 INFO L226 Difference]: Without dead ends: 1463 [2022-02-21 00:02:34,606 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,607 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 71 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 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:34,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 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:34,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2022-02-21 00:02:34,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1461. [2022-02-21 00:02:34,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:34,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1463 states. Second operand has 1461 states, 1460 states have (on average 1.7006849315068493) internal successors, (2483), 1460 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (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,625 INFO L74 IsIncluded]: Start isIncluded. First operand 1463 states. Second operand has 1461 states, 1460 states have (on average 1.7006849315068493) internal successors, (2483), 1460 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (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,626 INFO L87 Difference]: Start difference. First operand 1463 states. Second operand has 1461 states, 1460 states have (on average 1.7006849315068493) internal successors, (2483), 1460 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (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,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:34,678 INFO L93 Difference]: Finished difference Result 1463 states and 2484 transitions. [2022-02-21 00:02:34,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2484 transitions. [2022-02-21 00:02:34,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:34,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:34,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 1461 states, 1460 states have (on average 1.7006849315068493) internal successors, (2483), 1460 states have internal predecessors, (2483), 0 states have call successors, (0), 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 1463 states. [2022-02-21 00:02:34,682 INFO L87 Difference]: Start difference. First operand has 1461 states, 1460 states have (on average 1.7006849315068493) internal successors, (2483), 1460 states have internal predecessors, (2483), 0 states have call successors, (0), 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 1463 states. [2022-02-21 00:02:34,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:34,748 INFO L93 Difference]: Finished difference Result 1463 states and 2484 transitions. [2022-02-21 00:02:34,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2484 transitions. [2022-02-21 00:02:34,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:34,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:34,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:34,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:34,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 1460 states have (on average 1.7006849315068493) internal successors, (2483), 1460 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (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,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 2483 transitions. [2022-02-21 00:02:34,805 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 2483 transitions. Word has length 27 [2022-02-21 00:02:34,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:34,805 INFO L470 AbstractCegarLoop]: Abstraction has 1461 states and 2483 transitions. [2022-02-21 00:02:34,805 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:34,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 2483 transitions. [2022-02-21 00:02:34,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-21 00:02:34,806 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:34,806 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:34,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-21 00:02:34,807 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:34,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:34,807 INFO L85 PathProgramCache]: Analyzing trace with hash -933544735, now seen corresponding path program 1 times [2022-02-21 00:02:34,807 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:34,807 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624641153] [2022-02-21 00:02:34,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:34,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:34,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {32628#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); {32628#true} is VALID [2022-02-21 00:02:34,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {32628#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; {32628#true} is VALID [2022-02-21 00:02:34,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {32628#true} assume !false;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {32628#true} is VALID [2022-02-21 00:02:34,849 INFO L290 TraceCheckUtils]: 3: Hoare triple {32628#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;main_~lk15~0#1 := 0; {32628#true} is VALID [2022-02-21 00:02:34,849 INFO L290 TraceCheckUtils]: 4: Hoare triple {32628#true} assume !(0 != main_~p1~0#1); {32628#true} is VALID [2022-02-21 00:02:34,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {32628#true} assume !(0 != main_~p2~0#1); {32628#true} is VALID [2022-02-21 00:02:34,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {32628#true} assume !(0 != main_~p3~0#1); {32628#true} is VALID [2022-02-21 00:02:34,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {32628#true} assume !(0 != main_~p4~0#1); {32628#true} is VALID [2022-02-21 00:02:34,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {32628#true} assume !(0 != main_~p5~0#1); {32628#true} is VALID [2022-02-21 00:02:34,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {32628#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:34,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:34,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:34,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:34,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:34,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p11~0#1); {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:34,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:34,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:34,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:34,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:34,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p1~0#1); {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:34,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p2~0#1); {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:34,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p3~0#1); {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:34,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p4~0#1); {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:34,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p5~0#1); {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:34,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p6~0#1; {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:34,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {32630#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 1 != main_~lk6~0#1; {32629#false} is VALID [2022-02-21 00:02:34,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {32629#false} assume !false; {32629#false} is VALID [2022-02-21 00:02:34,855 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:34,855 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:34,855 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624641153] [2022-02-21 00:02:34,855 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624641153] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:34,855 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:34,855 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:34,855 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541947824] [2022-02-21 00:02:34,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:34,856 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,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:34,856 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:34,889 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:34,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:34,890 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:34,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:34,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:34,890 INFO L87 Difference]: Start difference. First operand 1461 states and 2483 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:35,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,173 INFO L93 Difference]: Finished difference Result 2695 states and 4628 transitions. [2022-02-21 00:02:35,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:35,174 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,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:35,174 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:35,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2022-02-21 00:02:35,175 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:35,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2022-02-21 00:02:35,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 166 transitions. [2022-02-21 00:02:35,271 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:35,455 INFO L225 Difference]: With dead ends: 2695 [2022-02-21 00:02:35,456 INFO L226 Difference]: Without dead ends: 2695 [2022-02-21 00:02:35,456 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:35,456 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 58 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 177 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:35,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 177 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:35,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2695 states. [2022-02-21 00:02:35,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2695 to 2053. [2022-02-21 00:02:35,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:35,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2695 states. Second operand has 2053 states, 2052 states have (on average 1.662280701754386) internal successors, (3411), 2052 states have internal predecessors, (3411), 0 states have call successors, (0), 0 states have call predecessors, (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,485 INFO L74 IsIncluded]: Start isIncluded. First operand 2695 states. Second operand has 2053 states, 2052 states have (on average 1.662280701754386) internal successors, (3411), 2052 states have internal predecessors, (3411), 0 states have call successors, (0), 0 states have call predecessors, (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,486 INFO L87 Difference]: Start difference. First operand 2695 states. Second operand has 2053 states, 2052 states have (on average 1.662280701754386) internal successors, (3411), 2052 states have internal predecessors, (3411), 0 states have call successors, (0), 0 states have call predecessors, (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,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,667 INFO L93 Difference]: Finished difference Result 2695 states and 4628 transitions. [2022-02-21 00:02:35,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 4628 transitions. [2022-02-21 00:02:35,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:35,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:35,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 2053 states, 2052 states have (on average 1.662280701754386) internal successors, (3411), 2052 states have internal predecessors, (3411), 0 states have call successors, (0), 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,674 INFO L87 Difference]: Start difference. First operand has 2053 states, 2052 states have (on average 1.662280701754386) internal successors, (3411), 2052 states have internal predecessors, (3411), 0 states have call successors, (0), 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,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,862 INFO L93 Difference]: Finished difference Result 2695 states and 4628 transitions. [2022-02-21 00:02:35,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 4628 transitions. [2022-02-21 00:02:35,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:35,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:35,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:35,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:35,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2052 states have (on average 1.662280701754386) internal successors, (3411), 2052 states have internal predecessors, (3411), 0 states have call successors, (0), 0 states have call predecessors, (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,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 3411 transitions. [2022-02-21 00:02:35,980 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 3411 transitions. Word has length 27 [2022-02-21 00:02:35,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:35,980 INFO L470 AbstractCegarLoop]: Abstraction has 2053 states and 3411 transitions. [2022-02-21 00:02:35,980 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,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 3411 transitions. [2022-02-21 00:02:35,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-21 00:02:35,982 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:35,982 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,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-21 00:02:35,983 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:35,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:35,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1367277855, now seen corresponding path program 1 times [2022-02-21 00:02:35,983 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:35,983 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907001320] [2022-02-21 00:02:35,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:35,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:36,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {42771#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); {42771#true} is VALID [2022-02-21 00:02:36,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {42771#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; {42771#true} is VALID [2022-02-21 00:02:36,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {42771#true} assume !false;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {42771#true} is VALID [2022-02-21 00:02:36,032 INFO L290 TraceCheckUtils]: 3: Hoare triple {42771#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;main_~lk15~0#1 := 0; {42771#true} is VALID [2022-02-21 00:02:36,032 INFO L290 TraceCheckUtils]: 4: Hoare triple {42771#true} assume !(0 != main_~p1~0#1); {42771#true} is VALID [2022-02-21 00:02:36,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {42771#true} assume !(0 != main_~p2~0#1); {42771#true} is VALID [2022-02-21 00:02:36,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {42771#true} assume !(0 != main_~p3~0#1); {42771#true} is VALID [2022-02-21 00:02:36,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {42771#true} assume !(0 != main_~p4~0#1); {42771#true} is VALID [2022-02-21 00:02:36,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {42771#true} assume !(0 != main_~p5~0#1); {42771#true} is VALID [2022-02-21 00:02:36,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {42771#true} assume !(0 != main_~p6~0#1); {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:36,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:36,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:36,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:36,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:36,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p11~0#1); {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:36,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:36,038 INFO L290 TraceCheckUtils]: 16: Hoare triple {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:36,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:36,039 INFO L290 TraceCheckUtils]: 18: Hoare triple {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:36,039 INFO L290 TraceCheckUtils]: 19: Hoare triple {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p1~0#1); {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:36,039 INFO L290 TraceCheckUtils]: 20: Hoare triple {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p2~0#1); {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:36,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p3~0#1); {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:36,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p4~0#1); {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:36,040 INFO L290 TraceCheckUtils]: 23: Hoare triple {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p5~0#1); {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:36,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {42773#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p6~0#1; {42772#false} is VALID [2022-02-21 00:02:36,040 INFO L290 TraceCheckUtils]: 25: Hoare triple {42772#false} assume 1 != main_~lk6~0#1; {42772#false} is VALID [2022-02-21 00:02:36,041 INFO L290 TraceCheckUtils]: 26: Hoare triple {42772#false} assume !false; {42772#false} is VALID [2022-02-21 00:02:36,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:36,043 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:36,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907001320] [2022-02-21 00:02:36,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907001320] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:36,043 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:36,043 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:36,043 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157902882] [2022-02-21 00:02:36,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:36,044 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,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:36,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:36,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:36,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:36,059 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:36,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:36,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:36,060 INFO L87 Difference]: Start difference. First operand 2053 states and 3411 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,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:36,343 INFO L93 Difference]: Finished difference Result 2855 states and 4740 transitions. [2022-02-21 00:02:36,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:36,344 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,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:36,344 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,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2022-02-21 00:02:36,345 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,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2022-02-21 00:02:36,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 175 transitions. [2022-02-21 00:02:36,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:36,652 INFO L225 Difference]: With dead ends: 2855 [2022-02-21 00:02:36,653 INFO L226 Difference]: Without dead ends: 2855 [2022-02-21 00:02:36,653 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,656 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 68 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 218 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:36,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 218 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:36,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2022-02-21 00:02:36,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 2853. [2022-02-21 00:02:36,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:36,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2855 states. Second operand has 2853 states, 2852 states have (on average 1.66164095371669) internal successors, (4739), 2852 states have internal predecessors, (4739), 0 states have call successors, (0), 0 states have call predecessors, (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,688 INFO L74 IsIncluded]: Start isIncluded. First operand 2855 states. Second operand has 2853 states, 2852 states have (on average 1.66164095371669) internal successors, (4739), 2852 states have internal predecessors, (4739), 0 states have call successors, (0), 0 states have call predecessors, (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,690 INFO L87 Difference]: Start difference. First operand 2855 states. Second operand has 2853 states, 2852 states have (on average 1.66164095371669) internal successors, (4739), 2852 states have internal predecessors, (4739), 0 states have call successors, (0), 0 states have call predecessors, (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,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:36,889 INFO L93 Difference]: Finished difference Result 2855 states and 4740 transitions. [2022-02-21 00:02:36,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 4740 transitions. [2022-02-21 00:02:36,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:36,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:36,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 2853 states, 2852 states have (on average 1.66164095371669) internal successors, (4739), 2852 states have internal predecessors, (4739), 0 states have call successors, (0), 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 2855 states. [2022-02-21 00:02:36,897 INFO L87 Difference]: Start difference. First operand has 2853 states, 2852 states have (on average 1.66164095371669) internal successors, (4739), 2852 states have internal predecessors, (4739), 0 states have call successors, (0), 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 2855 states. [2022-02-21 00:02:37,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:37,106 INFO L93 Difference]: Finished difference Result 2855 states and 4740 transitions. [2022-02-21 00:02:37,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 4740 transitions. [2022-02-21 00:02:37,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:37,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:37,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:37,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2852 states have (on average 1.66164095371669) internal successors, (4739), 2852 states have internal predecessors, (4739), 0 states have call successors, (0), 0 states have call predecessors, (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,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4739 transitions. [2022-02-21 00:02:37,332 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4739 transitions. Word has length 27 [2022-02-21 00:02:37,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:37,332 INFO L470 AbstractCegarLoop]: Abstraction has 2853 states and 4739 transitions. [2022-02-21 00:02:37,332 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:37,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4739 transitions. [2022-02-21 00:02:37,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-21 00:02:37,334 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:37,334 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:37,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-21 00:02:37,334 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:37,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:37,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1125097720, now seen corresponding path program 1 times [2022-02-21 00:02:37,335 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:37,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339473184] [2022-02-21 00:02:37,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:37,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:37,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {54194#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); {54194#true} is VALID [2022-02-21 00:02:37,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {54194#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; {54194#true} is VALID [2022-02-21 00:02:37,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {54194#true} assume !false;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {54194#true} is VALID [2022-02-21 00:02:37,369 INFO L290 TraceCheckUtils]: 3: Hoare triple {54194#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;main_~lk15~0#1 := 0; {54194#true} is VALID [2022-02-21 00:02:37,369 INFO L290 TraceCheckUtils]: 4: Hoare triple {54194#true} assume !(0 != main_~p1~0#1); {54194#true} is VALID [2022-02-21 00:02:37,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {54194#true} assume !(0 != main_~p2~0#1); {54194#true} is VALID [2022-02-21 00:02:37,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {54194#true} assume !(0 != main_~p3~0#1); {54194#true} is VALID [2022-02-21 00:02:37,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {54194#true} assume !(0 != main_~p4~0#1); {54194#true} is VALID [2022-02-21 00:02:37,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {54194#true} assume !(0 != main_~p5~0#1); {54194#true} is VALID [2022-02-21 00:02:37,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {54194#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:37,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:37,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:37,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:37,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:37,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p11~0#1); {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:37,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:37,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:37,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:37,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:37,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p1~0#1); {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:37,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p2~0#1); {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:37,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p3~0#1); {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:37,374 INFO L290 TraceCheckUtils]: 22: Hoare triple {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p4~0#1); {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:37,374 INFO L290 TraceCheckUtils]: 23: Hoare triple {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p5~0#1); {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:37,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {54196#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p6~0#1); {54195#false} is VALID [2022-02-21 00:02:37,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {54195#false} assume 0 != main_~p7~0#1; {54195#false} is VALID [2022-02-21 00:02:37,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {54195#false} assume 1 != main_~lk7~0#1; {54195#false} is VALID [2022-02-21 00:02:37,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {54195#false} assume !false; {54195#false} is VALID [2022-02-21 00:02:37,375 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:37,375 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:37,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339473184] [2022-02-21 00:02:37,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339473184] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:37,375 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:37,375 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:37,376 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225005330] [2022-02-21 00:02:37,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:37,377 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:37,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:37,377 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:37,410 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:37,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:37,411 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:37,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:37,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:37,412 INFO L87 Difference]: Start difference. First operand 2853 states and 4739 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:37,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:37,717 INFO L93 Difference]: Finished difference Result 2887 states and 4740 transitions. [2022-02-21 00:02:37,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:37,718 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:37,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:37,718 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:37,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2022-02-21 00:02:37,719 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:37,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2022-02-21 00:02:37,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 174 transitions. [2022-02-21 00:02:37,819 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:38,047 INFO L225 Difference]: With dead ends: 2887 [2022-02-21 00:02:38,048 INFO L226 Difference]: Without dead ends: 2887 [2022-02-21 00:02:38,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:38,049 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 70 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 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:38,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 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:38,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2022-02-21 00:02:38,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2885. [2022-02-21 00:02:38,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:38,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2887 states. Second operand has 2885 states, 2884 states have (on average 1.6432038834951457) internal successors, (4739), 2884 states have internal predecessors, (4739), 0 states have call successors, (0), 0 states have call predecessors, (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,080 INFO L74 IsIncluded]: Start isIncluded. First operand 2887 states. Second operand has 2885 states, 2884 states have (on average 1.6432038834951457) internal successors, (4739), 2884 states have internal predecessors, (4739), 0 states have call successors, (0), 0 states have call predecessors, (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,082 INFO L87 Difference]: Start difference. First operand 2887 states. Second operand has 2885 states, 2884 states have (on average 1.6432038834951457) internal successors, (4739), 2884 states have internal predecessors, (4739), 0 states have call successors, (0), 0 states have call predecessors, (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,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:38,296 INFO L93 Difference]: Finished difference Result 2887 states and 4740 transitions. [2022-02-21 00:02:38,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2887 states and 4740 transitions. [2022-02-21 00:02:38,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:38,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:38,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 2885 states, 2884 states have (on average 1.6432038834951457) internal successors, (4739), 2884 states have internal predecessors, (4739), 0 states have call successors, (0), 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 2887 states. [2022-02-21 00:02:38,304 INFO L87 Difference]: Start difference. First operand has 2885 states, 2884 states have (on average 1.6432038834951457) internal successors, (4739), 2884 states have internal predecessors, (4739), 0 states have call successors, (0), 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 2887 states. [2022-02-21 00:02:38,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:38,515 INFO L93 Difference]: Finished difference Result 2887 states and 4740 transitions. [2022-02-21 00:02:38,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2887 states and 4740 transitions. [2022-02-21 00:02:38,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:38,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:38,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:38,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:38,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2885 states, 2884 states have (on average 1.6432038834951457) internal successors, (4739), 2884 states have internal predecessors, (4739), 0 states have call successors, (0), 0 states have call predecessors, (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,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2885 states and 4739 transitions. [2022-02-21 00:02:38,748 INFO L78 Accepts]: Start accepts. Automaton has 2885 states and 4739 transitions. Word has length 28 [2022-02-21 00:02:38,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:38,749 INFO L470 AbstractCegarLoop]: Abstraction has 2885 states and 4739 transitions. [2022-02-21 00:02:38,749 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:38,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2885 states and 4739 transitions. [2022-02-21 00:02:38,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-21 00:02:38,750 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:38,750 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:38,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-21 00:02:38,751 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:38,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:38,752 INFO L85 PathProgramCache]: Analyzing trace with hash -563846022, now seen corresponding path program 1 times [2022-02-21 00:02:38,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:38,752 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121209985] [2022-02-21 00:02:38,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:38,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:38,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {65745#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); {65745#true} is VALID [2022-02-21 00:02:38,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {65745#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; {65745#true} is VALID [2022-02-21 00:02:38,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {65745#true} assume !false;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {65745#true} is VALID [2022-02-21 00:02:38,778 INFO L290 TraceCheckUtils]: 3: Hoare triple {65745#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;main_~lk15~0#1 := 0; {65745#true} is VALID [2022-02-21 00:02:38,778 INFO L290 TraceCheckUtils]: 4: Hoare triple {65745#true} assume !(0 != main_~p1~0#1); {65745#true} is VALID [2022-02-21 00:02:38,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {65745#true} assume !(0 != main_~p2~0#1); {65745#true} is VALID [2022-02-21 00:02:38,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {65745#true} assume !(0 != main_~p3~0#1); {65745#true} is VALID [2022-02-21 00:02:38,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {65745#true} assume !(0 != main_~p4~0#1); {65745#true} is VALID [2022-02-21 00:02:38,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {65745#true} assume !(0 != main_~p5~0#1); {65745#true} is VALID [2022-02-21 00:02:38,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {65745#true} assume !(0 != main_~p6~0#1); {65745#true} is VALID [2022-02-21 00:02:38,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {65745#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:38,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:38,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:38,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:38,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p11~0#1); {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:38,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:38,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:38,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:38,781 INFO L290 TraceCheckUtils]: 18: Hoare triple {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:38,781 INFO L290 TraceCheckUtils]: 19: Hoare triple {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p1~0#1); {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:38,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p2~0#1); {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:38,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p3~0#1); {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:38,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p4~0#1); {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:38,783 INFO L290 TraceCheckUtils]: 23: Hoare triple {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p5~0#1); {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:38,783 INFO L290 TraceCheckUtils]: 24: Hoare triple {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p6~0#1); {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:38,783 INFO L290 TraceCheckUtils]: 25: Hoare triple {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p7~0#1; {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:38,783 INFO L290 TraceCheckUtils]: 26: Hoare triple {65747#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 1 != main_~lk7~0#1; {65746#false} is VALID [2022-02-21 00:02:38,784 INFO L290 TraceCheckUtils]: 27: Hoare triple {65746#false} assume !false; {65746#false} is VALID [2022-02-21 00:02:38,784 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,784 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:38,784 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121209985] [2022-02-21 00:02:38,784 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121209985] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:38,784 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:38,784 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:38,784 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359422805] [2022-02-21 00:02:38,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:38,785 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:38,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:38,785 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:38,801 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:38,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:38,801 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:38,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:38,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:38,802 INFO L87 Difference]: Start difference. First operand 2885 states and 4739 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:39,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:39,622 INFO L93 Difference]: Finished difference Result 5255 states and 8740 transitions. [2022-02-21 00:02:39,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:39,622 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:39,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:39,623 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:39,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2022-02-21 00:02:39,624 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:39,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2022-02-21 00:02:39,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 162 transitions. [2022-02-21 00:02:39,718 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:40,528 INFO L225 Difference]: With dead ends: 5255 [2022-02-21 00:02:40,529 INFO L226 Difference]: Without dead ends: 5255 [2022-02-21 00:02:40,529 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,530 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 55 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 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:40,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 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:40,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5255 states. [2022-02-21 00:02:40,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5255 to 4101. [2022-02-21 00:02:40,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:40,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5255 states. Second operand has 4101 states, 4100 states have (on average 1.6007317073170733) internal successors, (6563), 4100 states have internal predecessors, (6563), 0 states have call successors, (0), 0 states have call predecessors, (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,571 INFO L74 IsIncluded]: Start isIncluded. First operand 5255 states. Second operand has 4101 states, 4100 states have (on average 1.6007317073170733) internal successors, (6563), 4100 states have internal predecessors, (6563), 0 states have call successors, (0), 0 states have call predecessors, (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,574 INFO L87 Difference]: Start difference. First operand 5255 states. Second operand has 4101 states, 4100 states have (on average 1.6007317073170733) internal successors, (6563), 4100 states have internal predecessors, (6563), 0 states have call successors, (0), 0 states have call predecessors, (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,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:41,296 INFO L93 Difference]: Finished difference Result 5255 states and 8740 transitions. [2022-02-21 00:02:41,296 INFO L276 IsEmpty]: Start isEmpty. Operand 5255 states and 8740 transitions. [2022-02-21 00:02:41,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:41,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:41,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 4101 states, 4100 states have (on average 1.6007317073170733) internal successors, (6563), 4100 states have internal predecessors, (6563), 0 states have call successors, (0), 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,306 INFO L87 Difference]: Start difference. First operand has 4101 states, 4100 states have (on average 1.6007317073170733) internal successors, (6563), 4100 states have internal predecessors, (6563), 0 states have call successors, (0), 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,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,097 INFO L93 Difference]: Finished difference Result 5255 states and 8740 transitions. [2022-02-21 00:02:42,097 INFO L276 IsEmpty]: Start isEmpty. Operand 5255 states and 8740 transitions. [2022-02-21 00:02:42,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:42,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:42,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:42,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:42,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4101 states, 4100 states have (on average 1.6007317073170733) internal successors, (6563), 4100 states have internal predecessors, (6563), 0 states have call successors, (0), 0 states have call predecessors, (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,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 6563 transitions. [2022-02-21 00:02:42,728 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 6563 transitions. Word has length 28 [2022-02-21 00:02:42,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:42,730 INFO L470 AbstractCegarLoop]: Abstraction has 4101 states and 6563 transitions. [2022-02-21 00:02:42,730 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:42,730 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 6563 transitions. [2022-02-21 00:02:42,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-21 00:02:42,734 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:42,735 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,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-21 00:02:42,735 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:42,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:42,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1736976568, now seen corresponding path program 1 times [2022-02-21 00:02:42,737 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:42,737 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51838433] [2022-02-21 00:02:42,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:42,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:42,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {85616#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); {85616#true} is VALID [2022-02-21 00:02:42,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {85616#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; {85616#true} is VALID [2022-02-21 00:02:42,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {85616#true} assume !false;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {85616#true} is VALID [2022-02-21 00:02:42,771 INFO L290 TraceCheckUtils]: 3: Hoare triple {85616#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;main_~lk15~0#1 := 0; {85616#true} is VALID [2022-02-21 00:02:42,771 INFO L290 TraceCheckUtils]: 4: Hoare triple {85616#true} assume !(0 != main_~p1~0#1); {85616#true} is VALID [2022-02-21 00:02:42,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {85616#true} assume !(0 != main_~p2~0#1); {85616#true} is VALID [2022-02-21 00:02:42,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {85616#true} assume !(0 != main_~p3~0#1); {85616#true} is VALID [2022-02-21 00:02:42,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {85616#true} assume !(0 != main_~p4~0#1); {85616#true} is VALID [2022-02-21 00:02:42,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {85616#true} assume !(0 != main_~p5~0#1); {85616#true} is VALID [2022-02-21 00:02:42,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {85616#true} assume !(0 != main_~p6~0#1); {85616#true} is VALID [2022-02-21 00:02:42,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {85616#true} assume !(0 != main_~p7~0#1); {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:42,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:42,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:42,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:42,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p11~0#1); {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:42,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:42,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:42,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:42,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:42,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p1~0#1); {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:42,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p2~0#1); {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:42,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p3~0#1); {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:42,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p4~0#1); {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:42,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p5~0#1); {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:42,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p6~0#1); {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:42,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {85618#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p7~0#1; {85617#false} is VALID [2022-02-21 00:02:42,778 INFO L290 TraceCheckUtils]: 26: Hoare triple {85617#false} assume 1 != main_~lk7~0#1; {85617#false} is VALID [2022-02-21 00:02:42,779 INFO L290 TraceCheckUtils]: 27: Hoare triple {85617#false} assume !false; {85617#false} is VALID [2022-02-21 00:02:42,779 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,779 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:42,779 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51838433] [2022-02-21 00:02:42,779 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51838433] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:42,779 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:42,780 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:42,780 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024461912] [2022-02-21 00:02:42,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:42,780 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,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:42,781 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,799 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,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:42,800 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:42,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:42,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:42,801 INFO L87 Difference]: Start difference. First operand 4101 states and 6563 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:44,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:44,062 INFO L93 Difference]: Finished difference Result 5639 states and 9028 transitions. [2022-02-21 00:02:44,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:44,063 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:44,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:44,063 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:44,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2022-02-21 00:02:44,064 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:44,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2022-02-21 00:02:44,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 173 transitions. [2022-02-21 00:02:44,179 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:45,434 INFO L225 Difference]: With dead ends: 5639 [2022-02-21 00:02:45,435 INFO L226 Difference]: Without dead ends: 5639 [2022-02-21 00:02:45,436 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:45,436 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 67 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 219 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:45,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 219 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:45,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2022-02-21 00:02:45,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5637. [2022-02-21 00:02:45,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:45,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5639 states. Second operand has 5637 states, 5636 states have (on average 1.60166784953868) internal successors, (9027), 5636 states have internal predecessors, (9027), 0 states have call successors, (0), 0 states have call predecessors, (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,565 INFO L74 IsIncluded]: Start isIncluded. First operand 5639 states. Second operand has 5637 states, 5636 states have (on average 1.60166784953868) internal successors, (9027), 5636 states have internal predecessors, (9027), 0 states have call successors, (0), 0 states have call predecessors, (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,569 INFO L87 Difference]: Start difference. First operand 5639 states. Second operand has 5637 states, 5636 states have (on average 1.60166784953868) internal successors, (9027), 5636 states have internal predecessors, (9027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:46,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:46,693 INFO L93 Difference]: Finished difference Result 5639 states and 9028 transitions. [2022-02-21 00:02:46,693 INFO L276 IsEmpty]: Start isEmpty. Operand 5639 states and 9028 transitions. [2022-02-21 00:02:46,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:46,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:46,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 5637 states, 5636 states have (on average 1.60166784953868) internal successors, (9027), 5636 states have internal predecessors, (9027), 0 states have call successors, (0), 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 5639 states. [2022-02-21 00:02:46,712 INFO L87 Difference]: Start difference. First operand has 5637 states, 5636 states have (on average 1.60166784953868) internal successors, (9027), 5636 states have internal predecessors, (9027), 0 states have call successors, (0), 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 5639 states. [2022-02-21 00:02:47,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:47,825 INFO L93 Difference]: Finished difference Result 5639 states and 9028 transitions. [2022-02-21 00:02:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 5639 states and 9028 transitions. [2022-02-21 00:02:47,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:47,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:47,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:47,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:47,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5637 states, 5636 states have (on average 1.60166784953868) internal successors, (9027), 5636 states have internal predecessors, (9027), 0 states have call successors, (0), 0 states have call predecessors, (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,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5637 states to 5637 states and 9027 transitions. [2022-02-21 00:02:49,015 INFO L78 Accepts]: Start accepts. Automaton has 5637 states and 9027 transitions. Word has length 28 [2022-02-21 00:02:49,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:49,015 INFO L470 AbstractCegarLoop]: Abstraction has 5637 states and 9027 transitions. [2022-02-21 00:02:49,015 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:49,015 INFO L276 IsEmpty]: Start isEmpty. Operand 5637 states and 9027 transitions. [2022-02-21 00:02:49,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-21 00:02:49,018 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:49,018 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:02:49,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-21 00:02:49,018 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:49,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:49,019 INFO L85 PathProgramCache]: Analyzing trace with hash -299143724, now seen corresponding path program 1 times [2022-02-21 00:02:49,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:49,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457445720] [2022-02-21 00:02:49,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:49,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:49,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {108175#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); {108175#true} is VALID [2022-02-21 00:02:49,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {108175#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; {108175#true} is VALID [2022-02-21 00:02:49,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {108175#true} assume !false;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {108175#true} is VALID [2022-02-21 00:02:49,048 INFO L290 TraceCheckUtils]: 3: Hoare triple {108175#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;main_~lk15~0#1 := 0; {108175#true} is VALID [2022-02-21 00:02:49,048 INFO L290 TraceCheckUtils]: 4: Hoare triple {108175#true} assume !(0 != main_~p1~0#1); {108175#true} is VALID [2022-02-21 00:02:49,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {108175#true} assume !(0 != main_~p2~0#1); {108175#true} is VALID [2022-02-21 00:02:49,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {108175#true} assume !(0 != main_~p3~0#1); {108175#true} is VALID [2022-02-21 00:02:49,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {108175#true} assume !(0 != main_~p4~0#1); {108175#true} is VALID [2022-02-21 00:02:49,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {108175#true} assume !(0 != main_~p5~0#1); {108175#true} is VALID [2022-02-21 00:02:49,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {108175#true} assume !(0 != main_~p6~0#1); {108175#true} is VALID [2022-02-21 00:02:49,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {108175#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:49,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:49,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:49,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:49,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p11~0#1); {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:49,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:49,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:49,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:49,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:49,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p1~0#1); {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:49,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p2~0#1); {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:49,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p3~0#1); {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:49,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p4~0#1); {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:49,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p5~0#1); {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:49,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p6~0#1); {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:49,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {108177#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p7~0#1); {108176#false} is VALID [2022-02-21 00:02:49,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {108176#false} assume 0 != main_~p8~0#1; {108176#false} is VALID [2022-02-21 00:02:49,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {108176#false} assume 1 != main_~lk8~0#1; {108176#false} is VALID [2022-02-21 00:02:49,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {108176#false} assume !false; {108176#false} is VALID [2022-02-21 00:02:49,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:49,055 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:49,055 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457445720] [2022-02-21 00:02:49,055 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457445720] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:49,055 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:49,055 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:49,056 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934287372] [2022-02-21 00:02:49,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:49,056 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:02:49,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:49,056 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:02:49,075 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:02:49,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:49,075 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:49,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:49,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:49,076 INFO L87 Difference]: Start difference. First operand 5637 states and 9027 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:02:50,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:50,271 INFO L93 Difference]: Finished difference Result 5703 states and 9028 transitions. [2022-02-21 00:02:50,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:50,271 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:02:50,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:50,272 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:02:50,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2022-02-21 00:02:50,273 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:02:50,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2022-02-21 00:02:50,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 172 transitions. [2022-02-21 00:02:50,389 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:51,559 INFO L225 Difference]: With dead ends: 5703 [2022-02-21 00:02:51,559 INFO L226 Difference]: Without dead ends: 5703 [2022-02-21 00:02:51,560 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:51,560 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 69 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 216 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:51,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 216 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:51,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5703 states. [2022-02-21 00:02:51,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5703 to 5701. [2022-02-21 00:02:51,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:51,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5703 states. Second operand has 5701 states, 5700 states have (on average 1.5836842105263158) internal successors, (9027), 5700 states have internal predecessors, (9027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:51,627 INFO L74 IsIncluded]: Start isIncluded. First operand 5703 states. Second operand has 5701 states, 5700 states have (on average 1.5836842105263158) internal successors, (9027), 5700 states have internal predecessors, (9027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:51,634 INFO L87 Difference]: Start difference. First operand 5703 states. Second operand has 5701 states, 5700 states have (on average 1.5836842105263158) internal successors, (9027), 5700 states have internal predecessors, (9027), 0 states have call successors, (0), 0 states have call predecessors, (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,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:52,793 INFO L93 Difference]: Finished difference Result 5703 states and 9028 transitions. [2022-02-21 00:02:52,793 INFO L276 IsEmpty]: Start isEmpty. Operand 5703 states and 9028 transitions. [2022-02-21 00:02:52,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:52,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:52,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 5701 states, 5700 states have (on average 1.5836842105263158) internal successors, (9027), 5700 states have internal predecessors, (9027), 0 states have call successors, (0), 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 5703 states. [2022-02-21 00:02:52,813 INFO L87 Difference]: Start difference. First operand has 5701 states, 5700 states have (on average 1.5836842105263158) internal successors, (9027), 5700 states have internal predecessors, (9027), 0 states have call successors, (0), 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 5703 states. [2022-02-21 00:02:53,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:53,986 INFO L93 Difference]: Finished difference Result 5703 states and 9028 transitions. [2022-02-21 00:02:53,987 INFO L276 IsEmpty]: Start isEmpty. Operand 5703 states and 9028 transitions. [2022-02-21 00:02:53,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:53,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:53,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:53,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:53,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5701 states, 5700 states have (on average 1.5836842105263158) internal successors, (9027), 5700 states have internal predecessors, (9027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:55,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5701 states to 5701 states and 9027 transitions. [2022-02-21 00:02:55,118 INFO L78 Accepts]: Start accepts. Automaton has 5701 states and 9027 transitions. Word has length 29 [2022-02-21 00:02:55,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:55,118 INFO L470 AbstractCegarLoop]: Abstraction has 5701 states and 9027 transitions. [2022-02-21 00:02:55,119 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:02:55,119 INFO L276 IsEmpty]: Start isEmpty. Operand 5701 states and 9027 transitions. [2022-02-21 00:02:55,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-21 00:02:55,121 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:55,121 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:02:55,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-21 00:02:55,122 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:55,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:55,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1988087466, now seen corresponding path program 1 times [2022-02-21 00:02:55,123 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:55,123 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079395190] [2022-02-21 00:02:55,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:55,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:55,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {130990#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); {130990#true} is VALID [2022-02-21 00:02:55,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {130990#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; {130990#true} is VALID [2022-02-21 00:02:55,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {130990#true} assume !false;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {130990#true} is VALID [2022-02-21 00:02:55,151 INFO L290 TraceCheckUtils]: 3: Hoare triple {130990#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;main_~lk15~0#1 := 0; {130990#true} is VALID [2022-02-21 00:02:55,151 INFO L290 TraceCheckUtils]: 4: Hoare triple {130990#true} assume !(0 != main_~p1~0#1); {130990#true} is VALID [2022-02-21 00:02:55,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {130990#true} assume !(0 != main_~p2~0#1); {130990#true} is VALID [2022-02-21 00:02:55,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {130990#true} assume !(0 != main_~p3~0#1); {130990#true} is VALID [2022-02-21 00:02:55,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {130990#true} assume !(0 != main_~p4~0#1); {130990#true} is VALID [2022-02-21 00:02:55,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {130990#true} assume !(0 != main_~p5~0#1); {130990#true} is VALID [2022-02-21 00:02:55,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {130990#true} assume !(0 != main_~p6~0#1); {130990#true} is VALID [2022-02-21 00:02:55,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {130990#true} assume !(0 != main_~p7~0#1); {130990#true} is VALID [2022-02-21 00:02:55,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {130990#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:55,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:55,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:55,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p11~0#1); {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:55,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:55,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:55,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:55,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:55,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p1~0#1); {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:55,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p2~0#1); {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:55,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p3~0#1); {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:55,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p4~0#1); {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:55,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p5~0#1); {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:55,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p6~0#1); {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:55,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p7~0#1); {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:55,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p8~0#1; {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:55,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {130992#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 1 != main_~lk8~0#1; {130991#false} is VALID [2022-02-21 00:02:55,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {130991#false} assume !false; {130991#false} is VALID [2022-02-21 00:02:55,158 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:55,158 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:55,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079395190] [2022-02-21 00:02:55,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079395190] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:55,158 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:55,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:55,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399608484] [2022-02-21 00:02:55,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:55,159 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:02:55,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:55,160 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:02:55,178 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:02:55,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:55,178 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:55,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:55,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:55,179 INFO L87 Difference]: Start difference. First operand 5701 states and 9027 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:02:58,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:58,987 INFO L93 Difference]: Finished difference Result 10247 states and 16452 transitions. [2022-02-21 00:02:58,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:58,987 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:02:58,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:58,988 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:02:58,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2022-02-21 00:02:58,989 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:02:58,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2022-02-21 00:02:58,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 158 transitions. [2022-02-21 00:02:59,079 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:02,179 INFO L225 Difference]: With dead ends: 10247 [2022-02-21 00:03:02,179 INFO L226 Difference]: Without dead ends: 10247 [2022-02-21 00:03:02,179 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:02,180 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 52 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 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:03:02,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 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:03:02,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10247 states. [2022-02-21 00:03:02,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10247 to 8197. [2022-02-21 00:03:02,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:02,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10247 states. Second operand has 8197 states, 8196 states have (on average 1.5386774036115178) internal successors, (12611), 8196 states have internal predecessors, (12611), 0 states have call successors, (0), 0 states have call 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,278 INFO L74 IsIncluded]: Start isIncluded. First operand 10247 states. Second operand has 8197 states, 8196 states have (on average 1.5386774036115178) internal successors, (12611), 8196 states have internal predecessors, (12611), 0 states have call successors, (0), 0 states have call 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,285 INFO L87 Difference]: Start difference. First operand 10247 states. Second operand has 8197 states, 8196 states have (on average 1.5386774036115178) internal successors, (12611), 8196 states have internal predecessors, (12611), 0 states have call successors, (0), 0 states have call 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:04,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:04,999 INFO L93 Difference]: Finished difference Result 10247 states and 16452 transitions. [2022-02-21 00:03:04,999 INFO L276 IsEmpty]: Start isEmpty. Operand 10247 states and 16452 transitions. [2022-02-21 00:03:05,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:05,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:05,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 8197 states, 8196 states have (on average 1.5386774036115178) internal successors, (12611), 8196 states have internal predecessors, (12611), 0 states have call successors, (0), 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 10247 states. [2022-02-21 00:03:05,021 INFO L87 Difference]: Start difference. First operand has 8197 states, 8196 states have (on average 1.5386774036115178) internal successors, (12611), 8196 states have internal predecessors, (12611), 0 states have call successors, (0), 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 10247 states. [2022-02-21 00:03:08,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:08,079 INFO L93 Difference]: Finished difference Result 10247 states and 16452 transitions. [2022-02-21 00:03:08,079 INFO L276 IsEmpty]: Start isEmpty. Operand 10247 states and 16452 transitions. [2022-02-21 00:03:08,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:08,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:08,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:08,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8197 states, 8196 states have (on average 1.5386774036115178) internal successors, (12611), 8196 states have internal predecessors, (12611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:10,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8197 states to 8197 states and 12611 transitions. [2022-02-21 00:03:10,595 INFO L78 Accepts]: Start accepts. Automaton has 8197 states and 12611 transitions. Word has length 29 [2022-02-21 00:03:10,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:10,595 INFO L470 AbstractCegarLoop]: Abstraction has 8197 states and 12611 transitions. [2022-02-21 00:03:10,595 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:10,596 INFO L276 IsEmpty]: Start isEmpty. Operand 8197 states and 12611 transitions. [2022-02-21 00:03:10,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-21 00:03:10,601 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:10,601 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:10,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-21 00:03:10,602 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:03:10,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:10,602 INFO L85 PathProgramCache]: Analyzing trace with hash 312735124, now seen corresponding path program 1 times [2022-02-21 00:03:10,603 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:10,603 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914524202] [2022-02-21 00:03:10,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:10,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:10,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {169933#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); {169933#true} is VALID [2022-02-21 00:03:10,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {169933#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; {169933#true} is VALID [2022-02-21 00:03:10,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {169933#true} assume !false;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {169933#true} is VALID [2022-02-21 00:03:10,627 INFO L290 TraceCheckUtils]: 3: Hoare triple {169933#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;main_~lk15~0#1 := 0; {169933#true} is VALID [2022-02-21 00:03:10,627 INFO L290 TraceCheckUtils]: 4: Hoare triple {169933#true} assume !(0 != main_~p1~0#1); {169933#true} is VALID [2022-02-21 00:03:10,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {169933#true} assume !(0 != main_~p2~0#1); {169933#true} is VALID [2022-02-21 00:03:10,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {169933#true} assume !(0 != main_~p3~0#1); {169933#true} is VALID [2022-02-21 00:03:10,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {169933#true} assume !(0 != main_~p4~0#1); {169933#true} is VALID [2022-02-21 00:03:10,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {169933#true} assume !(0 != main_~p5~0#1); {169933#true} is VALID [2022-02-21 00:03:10,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {169933#true} assume !(0 != main_~p6~0#1); {169933#true} is VALID [2022-02-21 00:03:10,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {169933#true} assume !(0 != main_~p7~0#1); {169933#true} is VALID [2022-02-21 00:03:10,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {169933#true} assume !(0 != main_~p8~0#1); {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:03:10,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:03:10,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:03:10,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p11~0#1); {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:03:10,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:03:10,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:03:10,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:03:10,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:03:10,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p1~0#1); {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:03:10,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p2~0#1); {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:03:10,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p3~0#1); {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:03:10,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p4~0#1); {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:03:10,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p5~0#1); {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:03:10,633 INFO L290 TraceCheckUtils]: 24: Hoare triple {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p6~0#1); {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:03:10,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p7~0#1); {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:03:10,634 INFO L290 TraceCheckUtils]: 26: Hoare triple {169935#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p8~0#1; {169934#false} is VALID [2022-02-21 00:03:10,634 INFO L290 TraceCheckUtils]: 27: Hoare triple {169934#false} assume 1 != main_~lk8~0#1; {169934#false} is VALID [2022-02-21 00:03:10,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {169934#false} assume !false; {169934#false} is VALID [2022-02-21 00:03:10,634 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:10,634 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:10,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914524202] [2022-02-21 00:03:10,635 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914524202] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:10,635 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:10,635 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:03:10,635 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028530381] [2022-02-21 00:03:10,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:10,635 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:10,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:10,636 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:10,654 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:10,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:03:10,654 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:10,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:03:10,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:10,655 INFO L87 Difference]: Start difference. First operand 8197 states and 12611 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:15,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:15,185 INFO L93 Difference]: Finished difference Result 11143 states and 17156 transitions. [2022-02-21 00:03:15,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:03:15,185 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:15,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:15,186 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:15,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2022-02-21 00:03:15,187 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:15,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2022-02-21 00:03:15,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 171 transitions. [2022-02-21 00:03:15,304 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:03:20,171 INFO L225 Difference]: With dead ends: 11143 [2022-02-21 00:03:20,171 INFO L226 Difference]: Without dead ends: 11143 [2022-02-21 00:03:20,172 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,172 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 66 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 220 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:20,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 220 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:20,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11143 states. [2022-02-21 00:03:20,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11143 to 11141. [2022-02-21 00:03:20,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:20,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11143 states. Second operand has 11141 states, 11140 states have (on average 1.5399461400359067) internal successors, (17155), 11140 states have internal predecessors, (17155), 0 states have call successors, (0), 0 states have call 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,334 INFO L74 IsIncluded]: Start isIncluded. First operand 11143 states. Second operand has 11141 states, 11140 states have (on average 1.5399461400359067) internal successors, (17155), 11140 states have internal predecessors, (17155), 0 states have call successors, (0), 0 states have call 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,349 INFO L87 Difference]: Start difference. First operand 11143 states. Second operand has 11141 states, 11140 states have (on average 1.5399461400359067) internal successors, (17155), 11140 states have internal predecessors, (17155), 0 states have call successors, (0), 0 states have call 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:24,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:24,758 INFO L93 Difference]: Finished difference Result 11143 states and 17156 transitions. [2022-02-21 00:03:24,758 INFO L276 IsEmpty]: Start isEmpty. Operand 11143 states and 17156 transitions. [2022-02-21 00:03:24,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:24,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:24,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 11141 states, 11140 states have (on average 1.5399461400359067) internal successors, (17155), 11140 states have internal predecessors, (17155), 0 states have call successors, (0), 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 11143 states. [2022-02-21 00:03:24,792 INFO L87 Difference]: Start difference. First operand has 11141 states, 11140 states have (on average 1.5399461400359067) internal successors, (17155), 11140 states have internal predecessors, (17155), 0 states have call successors, (0), 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 11143 states. [2022-02-21 00:03:28,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:28,286 INFO L93 Difference]: Finished difference Result 11143 states and 17156 transitions. [2022-02-21 00:03:28,286 INFO L276 IsEmpty]: Start isEmpty. Operand 11143 states and 17156 transitions. [2022-02-21 00:03:28,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:28,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:28,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:28,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:28,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11141 states, 11140 states have (on average 1.5399461400359067) internal successors, (17155), 11140 states have internal predecessors, (17155), 0 states have call successors, (0), 0 states have call 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:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11141 states to 11141 states and 17155 transitions. [2022-02-21 00:03:31,723 INFO L78 Accepts]: Start accepts. Automaton has 11141 states and 17155 transitions. Word has length 29 [2022-02-21 00:03:31,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:31,723 INFO L470 AbstractCegarLoop]: Abstraction has 11141 states and 17155 transitions. [2022-02-21 00:03:31,724 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:31,724 INFO L276 IsEmpty]: Start isEmpty. Operand 11141 states and 17155 transitions. [2022-02-21 00:03:31,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-21 00:03:31,729 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:31,729 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, 1] [2022-02-21 00:03:31,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-21 00:03:31,730 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:03:31,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:31,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1500955187, now seen corresponding path program 1 times [2022-02-21 00:03:31,730 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:31,731 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725913034] [2022-02-21 00:03:31,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:31,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:31,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {214508#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); {214508#true} is VALID [2022-02-21 00:03:31,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {214508#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; {214508#true} is VALID [2022-02-21 00:03:31,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {214508#true} assume !false;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; {214508#true} is VALID [2022-02-21 00:03:31,757 INFO L290 TraceCheckUtils]: 3: Hoare triple {214508#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;main_~lk15~0#1 := 0; {214508#true} is VALID [2022-02-21 00:03:31,757 INFO L290 TraceCheckUtils]: 4: Hoare triple {214508#true} assume !(0 != main_~p1~0#1); {214508#true} is VALID [2022-02-21 00:03:31,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {214508#true} assume !(0 != main_~p2~0#1); {214508#true} is VALID [2022-02-21 00:03:31,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {214508#true} assume !(0 != main_~p3~0#1); {214508#true} is VALID [2022-02-21 00:03:31,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {214508#true} assume !(0 != main_~p4~0#1); {214508#true} is VALID [2022-02-21 00:03:31,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {214508#true} assume !(0 != main_~p5~0#1); {214508#true} is VALID [2022-02-21 00:03:31,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {214508#true} assume !(0 != main_~p6~0#1); {214508#true} is VALID [2022-02-21 00:03:31,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {214508#true} assume !(0 != main_~p7~0#1); {214508#true} is VALID [2022-02-21 00:03:31,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {214508#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:31,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:31,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:31,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p11~0#1); {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:31,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:31,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:31,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:31,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:31,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p1~0#1); {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:31,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p2~0#1); {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:31,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p3~0#1); {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:31,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p4~0#1); {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:31,762 INFO L290 TraceCheckUtils]: 23: Hoare triple {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p5~0#1); {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:31,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p6~0#1); {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:31,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p7~0#1); {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:31,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {214510#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p8~0#1); {214509#false} is VALID [2022-02-21 00:03:31,763 INFO L290 TraceCheckUtils]: 27: Hoare triple {214509#false} assume 0 != main_~p9~0#1; {214509#false} is VALID [2022-02-21 00:03:31,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {214509#false} assume 1 != main_~lk9~0#1; {214509#false} is VALID [2022-02-21 00:03:31,764 INFO L290 TraceCheckUtils]: 29: Hoare triple {214509#false} assume !false; {214509#false} is VALID [2022-02-21 00:03:31,764 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:31,764 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:31,764 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725913034] [2022-02-21 00:03:31,765 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725913034] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:31,765 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:31,765 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:03:31,765 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144484185] [2022-02-21 00:03:31,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:31,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-21 00:03:31,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:31,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:31,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:31,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:03:31,785 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:31,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:03:31,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:31,786 INFO L87 Difference]: Start difference. First operand 11141 states and 17155 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:35,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:35,644 INFO L93 Difference]: Finished difference Result 11271 states and 17156 transitions. [2022-02-21 00:03:35,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:03:35,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-21 00:03:35,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:35,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:35,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2022-02-21 00:03:35,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:35,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2022-02-21 00:03:35,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 170 transitions. [2022-02-21 00:03:35,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.