./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_6.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_6.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 c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 00:02:32,848 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 00:02:32,850 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 00:02:32,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 00:02:32,902 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 00:02:32,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 00:02:32,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 00:02:32,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 00:02:32,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 00:02:32,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 00:02:32,914 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 00:02:32,916 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 00:02:32,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 00:02:32,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 00:02:32,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 00:02:32,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 00:02:32,928 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 00:02:32,929 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 00:02:32,930 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 00:02:32,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 00:02:32,935 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 00:02:32,936 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 00:02:32,937 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 00:02:32,938 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 00:02:32,940 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 00:02:32,942 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 00:02:32,943 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 00:02:32,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 00:02:32,944 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 00:02:32,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 00:02:32,945 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 00:02:32,946 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 00:02:32,947 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 00:02:32,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 00:02:32,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 00:02:32,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 00:02:32,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 00:02:32,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 00:02:32,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 00:02:32,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 00:02:32,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 00:02:32,953 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:32,985 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 00:02:32,985 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 00:02:32,986 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 00:02:32,986 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 00:02:32,987 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 00:02:32,987 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 00:02:32,987 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 00:02:32,987 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 00:02:32,988 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 00:02:32,988 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 00:02:32,989 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 00:02:32,989 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 00:02:32,989 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 00:02:32,989 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 00:02:32,989 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 00:02:32,990 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-21 00:02:32,990 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-21 00:02:32,990 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-21 00:02:32,990 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 00:02:32,990 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-21 00:02:32,990 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 00:02:32,990 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 00:02:32,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 00:02:32,991 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 00:02:32,991 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 00:02:32,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:32,991 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 00:02:32,992 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 00:02:32,992 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 00:02:32,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 00:02:32,992 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 -> c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 [2022-02-21 00:02:33,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 00:02:33,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 00:02:33,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 00:02:33,242 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 00:02:33,243 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 00:02:33,243 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_6.c [2022-02-21 00:02:33,294 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d6379a04/6cd82f344f68418aa070309e458b0ca2/FLAGe72be1478 [2022-02-21 00:02:33,672 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 00:02:33,672 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c [2022-02-21 00:02:33,680 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d6379a04/6cd82f344f68418aa070309e458b0ca2/FLAGe72be1478 [2022-02-21 00:02:34,098 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d6379a04/6cd82f344f68418aa070309e458b0ca2 [2022-02-21 00:02:34,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 00:02:34,102 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 00:02:34,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:34,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 00:02:34,105 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 00:02:34,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:34" (1/1) ... [2022-02-21 00:02:34,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3581b419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:34, skipping insertion in model container [2022-02-21 00:02:34,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:34" (1/1) ... [2022-02-21 00:02:34,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 00:02:34,123 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 00:02:34,262 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_6.c[2544,2557] [2022-02-21 00:02:34,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:34,270 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 00:02:34,282 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_6.c[2544,2557] [2022-02-21 00:02:34,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:34,291 INFO L208 MainTranslator]: Completed translation [2022-02-21 00:02:34,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:34 WrapperNode [2022-02-21 00:02:34,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:34,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:34,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 00:02:34,292 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 00:02:34,296 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:34" (1/1) ... [2022-02-21 00:02:34,300 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:34" (1/1) ... [2022-02-21 00:02:34,326 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 94 [2022-02-21 00:02:34,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:34,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 00:02:34,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 00:02:34,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 00:02:34,332 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:34" (1/1) ... [2022-02-21 00:02:34,332 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:34" (1/1) ... [2022-02-21 00:02:34,340 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:34" (1/1) ... [2022-02-21 00:02:34,340 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:34" (1/1) ... [2022-02-21 00:02:34,346 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:34" (1/1) ... [2022-02-21 00:02:34,352 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:34" (1/1) ... [2022-02-21 00:02:34,353 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:34" (1/1) ... [2022-02-21 00:02:34,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 00:02:34,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 00:02:34,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 00:02:34,358 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 00:02:34,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:34" (1/1) ... [2022-02-21 00:02:34,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:34,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:34,384 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:34,390 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:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 00:02:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 00:02:34,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 00:02:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 00:02:34,456 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 00:02:34,457 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 00:02:34,719 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 00:02:34,724 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 00:02:34,727 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 00:02:34,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:34 BoogieIcfgContainer [2022-02-21 00:02:34,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 00:02:34,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 00:02:34,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 00:02:34,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 00:02:34,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 12:02:34" (1/3) ... [2022-02-21 00:02:34,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d77e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:34, skipping insertion in model container [2022-02-21 00:02:34,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:34" (2/3) ... [2022-02-21 00:02:34,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d77e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:34, skipping insertion in model container [2022-02-21 00:02:34,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:34" (3/3) ... [2022-02-21 00:02:34,738 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2022-02-21 00:02:34,742 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 00:02:34,742 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-21 00:02:34,777 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 00:02:34,783 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:34,784 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-21 00:02:34,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 28 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (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,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 00:02:34,800 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:34,801 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 00:02:34,802 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:34,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:34,805 INFO L85 PathProgramCache]: Analyzing trace with hash 28807962, now seen corresponding path program 1 times [2022-02-21 00:02:34,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:34,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040968738] [2022-02-21 00:02:34,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:34,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:34,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#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(15, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-02-21 00:02:34,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#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_~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_~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;havoc main_~cond~0#1; {32#true} is VALID [2022-02-21 00:02:34,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume !true; {33#false} is VALID [2022-02-21 00:02:34,938 INFO L290 TraceCheckUtils]: 3: Hoare triple {33#false} main_#res#1 := 0; {33#false} is VALID [2022-02-21 00:02:34,938 INFO L290 TraceCheckUtils]: 4: Hoare triple {33#false} assume !(#valid == main_old_#valid#1); {33#false} is VALID [2022-02-21 00:02:34,939 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,939 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:34,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040968738] [2022-02-21 00:02:34,940 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040968738] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:34,940 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:34,940 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:34,941 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471803811] [2022-02-21 00:02:34,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:34,945 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:34,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:34,947 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:34,959 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:34,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-21 00:02:34,960 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:34,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 00:02:34,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 00:02:34,981 INFO L87 Difference]: Start difference. First operand has 29 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 28 states have internal predecessors, (49), 0 states have call successors, (0), 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:35,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,019 INFO L93 Difference]: Finished difference Result 29 states and 46 transitions. [2022-02-21 00:02:35,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 00:02:35,020 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:35,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:35,021 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:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2022-02-21 00:02:35,026 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:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2022-02-21 00:02:35,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2022-02-21 00:02:35,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:35,090 INFO L225 Difference]: With dead ends: 29 [2022-02-21 00:02:35,090 INFO L226 Difference]: Without dead ends: 27 [2022-02-21 00:02:35,091 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:35,094 INFO L933 BasicCegarLoop]: 46 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, 46 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:35,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 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:35,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-21 00:02:35,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-21 00:02:35,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:35,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 25 states have (on average 1.76) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (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,128 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 25 states have (on average 1.76) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (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,130 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 25 states have (on average 1.76) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (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,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,134 INFO L93 Difference]: Finished difference Result 27 states and 44 transitions. [2022-02-21 00:02:35,135 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 44 transitions. [2022-02-21 00:02:35,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:35,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:35,135 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 25 states have (on average 1.76) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 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 27 states. [2022-02-21 00:02:35,136 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.76) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 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 27 states. [2022-02-21 00:02:35,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,137 INFO L93 Difference]: Finished difference Result 27 states and 44 transitions. [2022-02-21 00:02:35,137 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 44 transitions. [2022-02-21 00:02:35,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:35,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:35,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:35,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:35,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.76) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (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,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 44 transitions. [2022-02-21 00:02:35,140 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 44 transitions. Word has length 5 [2022-02-21 00:02:35,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:35,141 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 44 transitions. [2022-02-21 00:02:35,141 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:35,141 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 44 transitions. [2022-02-21 00:02:35,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 00:02:35,141 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:35,141 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 00:02:35,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 00:02:35,142 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:35,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:35,143 INFO L85 PathProgramCache]: Analyzing trace with hash 889695787, now seen corresponding path program 1 times [2022-02-21 00:02:35,143 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:35,143 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580478166] [2022-02-21 00:02:35,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:35,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:35,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {146#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(15, 2);call #Ultimate.allocInit(12, 3); {146#true} is VALID [2022-02-21 00:02:35,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#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_~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_~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;havoc main_~cond~0#1; {148#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:35,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {148#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {148#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:35,173 INFO L290 TraceCheckUtils]: 3: Hoare triple {148#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume 0 == main_~cond~0#1; {148#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:35,174 INFO L290 TraceCheckUtils]: 4: Hoare triple {148#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} main_#res#1 := 0; {148#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:35,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {148#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {147#false} is VALID [2022-02-21 00:02:35,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:35,175 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:35,175 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580478166] [2022-02-21 00:02:35,175 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580478166] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:35,175 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:35,175 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:35,176 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306099788] [2022-02-21 00:02:35,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:35,177 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:35,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:35,177 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:35,182 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:35,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:35,182 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:35,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:35,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:35,183 INFO L87 Difference]: Start difference. First operand 27 states and 44 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:35,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,213 INFO L93 Difference]: Finished difference Result 26 states and 43 transitions. [2022-02-21 00:02:35,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:35,213 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:35,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:35,213 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:35,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-02-21 00:02:35,214 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:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-02-21 00:02:35,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 44 transitions. [2022-02-21 00:02:35,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:35,251 INFO L225 Difference]: With dead ends: 26 [2022-02-21 00:02:35,251 INFO L226 Difference]: Without dead ends: 24 [2022-02-21 00:02:35,251 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:35,252 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 43 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:35,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 43 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:35,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-21 00:02:35,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-21 00:02:35,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:35,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (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,256 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (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,257 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (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,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,258 INFO L93 Difference]: Finished difference Result 24 states and 41 transitions. [2022-02-21 00:02:35,258 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2022-02-21 00:02:35,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:35,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:35,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 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 24 states. [2022-02-21 00:02:35,259 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 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 24 states. [2022-02-21 00:02:35,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,260 INFO L93 Difference]: Finished difference Result 24 states and 41 transitions. [2022-02-21 00:02:35,260 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2022-02-21 00:02:35,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:35,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:35,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:35,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:35,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (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,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 41 transitions. [2022-02-21 00:02:35,262 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 41 transitions. Word has length 6 [2022-02-21 00:02:35,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:35,262 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 41 transitions. [2022-02-21 00:02:35,262 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:35,263 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2022-02-21 00:02:35,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-21 00:02:35,263 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:35,263 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:35,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 00:02:35,264 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:35,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:35,264 INFO L85 PathProgramCache]: Analyzing trace with hash -721193823, now seen corresponding path program 1 times [2022-02-21 00:02:35,265 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:35,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214153028] [2022-02-21 00:02:35,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:35,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:35,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {249#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(15, 2);call #Ultimate.allocInit(12, 3); {249#true} is VALID [2022-02-21 00:02:35,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {249#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_~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_~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;havoc main_~cond~0#1; {249#true} is VALID [2022-02-21 00:02:35,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {249#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {249#true} is VALID [2022-02-21 00:02:35,307 INFO L290 TraceCheckUtils]: 3: Hoare triple {249#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; {249#true} is VALID [2022-02-21 00:02:35,308 INFO L290 TraceCheckUtils]: 4: Hoare triple {249#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {251#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:35,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {251#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:35,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {251#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume !(0 != main_~p3~0#1); {251#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:35,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {251#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {251#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:35,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {251#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {251#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:35,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {251#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {251#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:35,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {251#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p1~0#1; {251#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:35,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {251#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 1 != main_~lk1~0#1; {250#false} is VALID [2022-02-21 00:02:35,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {250#false} assume !false; {250#false} is VALID [2022-02-21 00:02:35,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:35,311 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:35,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214153028] [2022-02-21 00:02:35,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214153028] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:35,311 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:35,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:35,312 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596344124] [2022-02-21 00:02:35,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:35,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-02-21 00:02:35,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:35,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (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,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:35,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:35,322 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:35,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:35,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:35,322 INFO L87 Difference]: Start difference. First operand 24 states and 41 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (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,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,364 INFO L93 Difference]: Finished difference Result 45 states and 77 transitions. [2022-02-21 00:02:35,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:35,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-02-21 00:02:35,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:35,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (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,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-02-21 00:02:35,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (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,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-02-21 00:02:35,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2022-02-21 00:02:35,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:35,413 INFO L225 Difference]: With dead ends: 45 [2022-02-21 00:02:35,413 INFO L226 Difference]: Without dead ends: 45 [2022-02-21 00:02:35,414 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,415 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 79 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,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 79 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,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-21 00:02:35,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2022-02-21 00:02:35,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:35,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (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,424 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (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,424 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (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,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,426 INFO L93 Difference]: Finished difference Result 45 states and 77 transitions. [2022-02-21 00:02:35,426 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 77 transitions. [2022-02-21 00:02:35,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:35,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:35,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 45 states. [2022-02-21 00:02:35,427 INFO L87 Difference]: Start difference. First operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 45 states. [2022-02-21 00:02:35,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,428 INFO L93 Difference]: Finished difference Result 45 states and 77 transitions. [2022-02-21 00:02:35,428 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 77 transitions. [2022-02-21 00:02:35,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:35,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:35,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:35,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:35,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (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,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 54 transitions. [2022-02-21 00:02:35,430 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 54 transitions. Word has length 13 [2022-02-21 00:02:35,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:35,431 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 54 transitions. [2022-02-21 00:02:35,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (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,431 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 54 transitions. [2022-02-21 00:02:35,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-21 00:02:35,431 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:35,431 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:35,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 00:02:35,432 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:35,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:35,432 INFO L85 PathProgramCache]: Analyzing trace with hash -41135453, now seen corresponding path program 1 times [2022-02-21 00:02:35,433 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:35,433 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712910227] [2022-02-21 00:02:35,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:35,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:35,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {420#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(15, 2);call #Ultimate.allocInit(12, 3); {420#true} is VALID [2022-02-21 00:02:35,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {420#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_~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_~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;havoc main_~cond~0#1; {420#true} is VALID [2022-02-21 00:02:35,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {420#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {420#true} is VALID [2022-02-21 00:02:35,459 INFO L290 TraceCheckUtils]: 3: Hoare triple {420#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; {420#true} is VALID [2022-02-21 00:02:35,460 INFO L290 TraceCheckUtils]: 4: Hoare triple {420#true} assume !(0 != main_~p1~0#1); {422#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:35,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {422#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {422#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:35,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {422#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume !(0 != main_~p3~0#1); {422#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:35,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {422#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {422#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:35,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {422#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {422#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:35,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {422#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {422#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:35,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {422#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p1~0#1; {421#false} is VALID [2022-02-21 00:02:35,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {421#false} assume 1 != main_~lk1~0#1; {421#false} is VALID [2022-02-21 00:02:35,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {421#false} assume !false; {421#false} is VALID [2022-02-21 00:02:35,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:35,463 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:35,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712910227] [2022-02-21 00:02:35,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712910227] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:35,463 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:35,463 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:35,464 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391055805] [2022-02-21 00:02:35,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:35,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-02-21 00:02:35,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:35,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (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,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:35,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:35,473 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:35,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:35,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:35,473 INFO L87 Difference]: Start difference. First operand 31 states and 54 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (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,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,514 INFO L93 Difference]: Finished difference Result 45 states and 75 transitions. [2022-02-21 00:02:35,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:35,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-02-21 00:02:35,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:35,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (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,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-02-21 00:02:35,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (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,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-02-21 00:02:35,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2022-02-21 00:02:35,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:35,563 INFO L225 Difference]: With dead ends: 45 [2022-02-21 00:02:35,563 INFO L226 Difference]: Without dead ends: 45 [2022-02-21 00:02:35,564 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,564 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 28 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 87 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:35,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 87 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:35,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-21 00:02:35,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2022-02-21 00:02:35,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:35,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 43 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 42 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (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,568 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 43 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 42 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (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,568 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 43 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 42 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (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,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,569 INFO L93 Difference]: Finished difference Result 45 states and 75 transitions. [2022-02-21 00:02:35,569 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 75 transitions. [2022-02-21 00:02:35,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:35,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:35,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 42 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 45 states. [2022-02-21 00:02:35,570 INFO L87 Difference]: Start difference. First operand has 43 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 42 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 45 states. [2022-02-21 00:02:35,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,572 INFO L93 Difference]: Finished difference Result 45 states and 75 transitions. [2022-02-21 00:02:35,572 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 75 transitions. [2022-02-21 00:02:35,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:35,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:35,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:35,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:35,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 42 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (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,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2022-02-21 00:02:35,574 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 13 [2022-02-21 00:02:35,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:35,574 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 74 transitions. [2022-02-21 00:02:35,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (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,574 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2022-02-21 00:02:35,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-21 00:02:35,575 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:35,575 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:35,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 00:02:35,575 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:35,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:35,576 INFO L85 PathProgramCache]: Analyzing trace with hash -881957389, now seen corresponding path program 1 times [2022-02-21 00:02:35,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:35,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742109823] [2022-02-21 00:02:35,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:35,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:35,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {603#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(15, 2);call #Ultimate.allocInit(12, 3); {603#true} is VALID [2022-02-21 00:02:35,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {603#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_~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_~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;havoc main_~cond~0#1; {603#true} is VALID [2022-02-21 00:02:35,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {603#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {603#true} is VALID [2022-02-21 00:02:35,602 INFO L290 TraceCheckUtils]: 3: Hoare triple {603#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; {603#true} is VALID [2022-02-21 00:02:35,603 INFO L290 TraceCheckUtils]: 4: Hoare triple {603#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {605#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:35,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {605#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {605#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:35,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {605#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p3~0#1); {605#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:35,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {605#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {605#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:35,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {605#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {605#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:35,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {605#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {605#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:35,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {605#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p1~0#1); {604#false} is VALID [2022-02-21 00:02:35,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {604#false} assume 0 != main_~p2~0#1; {604#false} is VALID [2022-02-21 00:02:35,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {604#false} assume 1 != main_~lk2~0#1; {604#false} is VALID [2022-02-21 00:02:35,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {604#false} assume !false; {604#false} is VALID [2022-02-21 00:02:35,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:35,606 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:35,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742109823] [2022-02-21 00:02:35,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742109823] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:35,606 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:35,606 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:35,607 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488554480] [2022-02-21 00:02:35,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:35,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-02-21 00:02:35,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:35,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (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,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:35,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:35,620 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:35,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:35,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:35,620 INFO L87 Difference]: Start difference. First operand 43 states and 74 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (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,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,661 INFO L93 Difference]: Finished difference Result 48 states and 77 transitions. [2022-02-21 00:02:35,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:35,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-02-21 00:02:35,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:35,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (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,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-02-21 00:02:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (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,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-02-21 00:02:35,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2022-02-21 00:02:35,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:35,711 INFO L225 Difference]: With dead ends: 48 [2022-02-21 00:02:35,711 INFO L226 Difference]: Without dead ends: 48 [2022-02-21 00:02:35,712 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,712 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 30 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 96 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:35,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 96 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:35,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-21 00:02:35,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-02-21 00:02:35,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:35,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 46 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 45 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (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,715 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 46 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 45 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (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,716 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 46 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 45 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (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,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,717 INFO L93 Difference]: Finished difference Result 48 states and 77 transitions. [2022-02-21 00:02:35,717 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 77 transitions. [2022-02-21 00:02:35,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:35,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:35,718 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 45 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 48 states. [2022-02-21 00:02:35,718 INFO L87 Difference]: Start difference. First operand has 46 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 45 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 48 states. [2022-02-21 00:02:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,719 INFO L93 Difference]: Finished difference Result 48 states and 77 transitions. [2022-02-21 00:02:35,719 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 77 transitions. [2022-02-21 00:02:35,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:35,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:35,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:35,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:35,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 45 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (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,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 76 transitions. [2022-02-21 00:02:35,721 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 76 transitions. Word has length 14 [2022-02-21 00:02:35,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:35,721 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 76 transitions. [2022-02-21 00:02:35,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (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,721 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 76 transitions. [2022-02-21 00:02:35,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-21 00:02:35,722 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:35,722 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:35,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 00:02:35,722 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:35,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:35,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1274984399, now seen corresponding path program 1 times [2022-02-21 00:02:35,723 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:35,723 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187056433] [2022-02-21 00:02:35,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:35,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:35,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {798#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(15, 2);call #Ultimate.allocInit(12, 3); {798#true} is VALID [2022-02-21 00:02:35,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {798#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_~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_~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;havoc main_~cond~0#1; {798#true} is VALID [2022-02-21 00:02:35,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {798#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {798#true} is VALID [2022-02-21 00:02:35,746 INFO L290 TraceCheckUtils]: 3: Hoare triple {798#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; {798#true} is VALID [2022-02-21 00:02:35,746 INFO L290 TraceCheckUtils]: 4: Hoare triple {798#true} assume !(0 != main_~p1~0#1); {798#true} is VALID [2022-02-21 00:02:35,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {798#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {800#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:35,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {800#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p3~0#1); {800#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:35,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {800#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {800#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:35,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {800#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {800#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:35,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {800#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {800#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:35,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {800#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p1~0#1); {800#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:35,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {800#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p2~0#1; {800#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:35,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {800#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 1 != main_~lk2~0#1; {799#false} is VALID [2022-02-21 00:02:35,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {799#false} assume !false; {799#false} is VALID [2022-02-21 00:02:35,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:35,749 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:35,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187056433] [2022-02-21 00:02:35,750 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187056433] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:35,750 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:35,750 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:35,750 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902043135] [2022-02-21 00:02:35,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:35,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-02-21 00:02:35,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:35,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (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,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:35,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:35,759 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:35,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:35,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:35,760 INFO L87 Difference]: Start difference. First operand 46 states and 76 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (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,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,800 INFO L93 Difference]: Finished difference Result 83 states and 138 transitions. [2022-02-21 00:02:35,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:35,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-02-21 00:02:35,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:35,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (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,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-02-21 00:02:35,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (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,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-02-21 00:02:35,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2022-02-21 00:02:35,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:35,845 INFO L225 Difference]: With dead ends: 83 [2022-02-21 00:02:35,845 INFO L226 Difference]: Without dead ends: 83 [2022-02-21 00:02:35,845 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,846 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 25 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 77 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,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 77 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,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-02-21 00:02:35,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2022-02-21 00:02:35,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:35,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 61 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 60 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (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,850 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 61 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 60 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (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,850 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 61 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 60 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (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,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,852 INFO L93 Difference]: Finished difference Result 83 states and 138 transitions. [2022-02-21 00:02:35,852 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 138 transitions. [2022-02-21 00:02:35,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:35,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:35,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 60 states have internal predecessors, (101), 0 states have call successors, (0), 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 83 states. [2022-02-21 00:02:35,853 INFO L87 Difference]: Start difference. First operand has 61 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 60 states have internal predecessors, (101), 0 states have call successors, (0), 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 83 states. [2022-02-21 00:02:35,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,855 INFO L93 Difference]: Finished difference Result 83 states and 138 transitions. [2022-02-21 00:02:35,856 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 138 transitions. [2022-02-21 00:02:35,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:35,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:35,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:35,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:35,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 60 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (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,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 101 transitions. [2022-02-21 00:02:35,858 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 101 transitions. Word has length 14 [2022-02-21 00:02:35,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:35,858 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 101 transitions. [2022-02-21 00:02:35,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (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,859 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 101 transitions. [2022-02-21 00:02:35,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-21 00:02:35,859 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:35,859 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:35,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 00:02:35,859 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:35,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:35,860 INFO L85 PathProgramCache]: Analyzing trace with hash -594926029, now seen corresponding path program 1 times [2022-02-21 00:02:35,860 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:35,860 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617064623] [2022-02-21 00:02:35,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:35,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:35,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {1113#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(15, 2);call #Ultimate.allocInit(12, 3); {1113#true} is VALID [2022-02-21 00:02:35,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {1113#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_~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_~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;havoc main_~cond~0#1; {1113#true} is VALID [2022-02-21 00:02:35,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {1113#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {1113#true} is VALID [2022-02-21 00:02:35,888 INFO L290 TraceCheckUtils]: 3: Hoare triple {1113#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; {1113#true} is VALID [2022-02-21 00:02:35,888 INFO L290 TraceCheckUtils]: 4: Hoare triple {1113#true} assume !(0 != main_~p1~0#1); {1113#true} is VALID [2022-02-21 00:02:35,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {1113#true} assume !(0 != main_~p2~0#1); {1115#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:35,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {1115#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p3~0#1); {1115#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:35,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {1115#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1115#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:35,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {1115#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1115#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:35,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {1115#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1115#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:35,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {1115#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p1~0#1); {1115#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:35,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {1115#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p2~0#1; {1114#false} is VALID [2022-02-21 00:02:35,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {1114#false} assume 1 != main_~lk2~0#1; {1114#false} is VALID [2022-02-21 00:02:35,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {1114#false} assume !false; {1114#false} is VALID [2022-02-21 00:02:35,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:35,891 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:35,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617064623] [2022-02-21 00:02:35,892 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617064623] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:35,892 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:35,892 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:35,892 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409031853] [2022-02-21 00:02:35,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:35,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-02-21 00:02:35,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:35,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (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,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:35,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:35,901 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:35,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:35,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:35,902 INFO L87 Difference]: Start difference. First operand 61 states and 101 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (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,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,945 INFO L93 Difference]: Finished difference Result 85 states and 136 transitions. [2022-02-21 00:02:35,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:35,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-02-21 00:02:35,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:35,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (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,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-02-21 00:02:35,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (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,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-02-21 00:02:35,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 75 transitions. [2022-02-21 00:02:35,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:36,000 INFO L225 Difference]: With dead ends: 85 [2022-02-21 00:02:36,000 INFO L226 Difference]: Without dead ends: 85 [2022-02-21 00:02:36,000 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,001 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 27 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 88 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,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 88 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,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-02-21 00:02:36,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2022-02-21 00:02:36,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:36,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 83 states, 82 states have (on average 1.646341463414634) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (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,005 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 83 states, 82 states have (on average 1.646341463414634) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (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,005 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 83 states, 82 states have (on average 1.646341463414634) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (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,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:36,007 INFO L93 Difference]: Finished difference Result 85 states and 136 transitions. [2022-02-21 00:02:36,007 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 136 transitions. [2022-02-21 00:02:36,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:36,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:36,008 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 82 states have (on average 1.646341463414634) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 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 85 states. [2022-02-21 00:02:36,008 INFO L87 Difference]: Start difference. First operand has 83 states, 82 states have (on average 1.646341463414634) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 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 85 states. [2022-02-21 00:02:36,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:36,010 INFO L93 Difference]: Finished difference Result 85 states and 136 transitions. [2022-02-21 00:02:36,011 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 136 transitions. [2022-02-21 00:02:36,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:36,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:36,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:36,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:36,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.646341463414634) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (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,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 135 transitions. [2022-02-21 00:02:36,013 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 135 transitions. Word has length 14 [2022-02-21 00:02:36,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:36,014 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 135 transitions. [2022-02-21 00:02:36,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (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,014 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 135 transitions. [2022-02-21 00:02:36,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-21 00:02:36,014 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:36,014 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:36,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-21 00:02:36,015 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:36,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:36,015 INFO L85 PathProgramCache]: Analyzing trace with hash -869595720, now seen corresponding path program 1 times [2022-02-21 00:02:36,015 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:36,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761593745] [2022-02-21 00:02:36,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:36,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:36,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {1456#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(15, 2);call #Ultimate.allocInit(12, 3); {1456#true} is VALID [2022-02-21 00:02:36,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {1456#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_~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_~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;havoc main_~cond~0#1; {1456#true} is VALID [2022-02-21 00:02:36,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {1456#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {1456#true} is VALID [2022-02-21 00:02:36,037 INFO L290 TraceCheckUtils]: 3: Hoare triple {1456#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; {1456#true} is VALID [2022-02-21 00:02:36,037 INFO L290 TraceCheckUtils]: 4: Hoare triple {1456#true} assume !(0 != main_~p1~0#1); {1456#true} is VALID [2022-02-21 00:02:36,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {1456#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {1458#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:36,038 INFO L290 TraceCheckUtils]: 6: Hoare triple {1458#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p3~0#1); {1458#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:36,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {1458#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1458#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:36,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {1458#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1458#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:36,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {1458#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1458#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:36,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {1458#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p1~0#1); {1458#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:36,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {1458#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p2~0#1); {1457#false} is VALID [2022-02-21 00:02:36,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {1457#false} assume 0 != main_~p3~0#1; {1457#false} is VALID [2022-02-21 00:02:36,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {1457#false} assume 1 != main_~lk3~0#1; {1457#false} is VALID [2022-02-21 00:02:36,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {1457#false} assume !false; {1457#false} is VALID [2022-02-21 00:02:36,041 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,041 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:36,041 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761593745] [2022-02-21 00:02:36,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761593745] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:36,041 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:36,041 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:36,042 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553742302] [2022-02-21 00:02:36,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:36,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-02-21 00:02:36,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:36,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (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,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:36,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:36,051 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:36,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:36,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:36,052 INFO L87 Difference]: Start difference. First operand 83 states and 135 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (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,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:36,095 INFO L93 Difference]: Finished difference Result 87 states and 136 transitions. [2022-02-21 00:02:36,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:36,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-02-21 00:02:36,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:36,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (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,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-02-21 00:02:36,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (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,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-02-21 00:02:36,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2022-02-21 00:02:36,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:36,141 INFO L225 Difference]: With dead ends: 87 [2022-02-21 00:02:36,141 INFO L226 Difference]: Without dead ends: 87 [2022-02-21 00:02:36,141 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,142 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 29 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 92 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:36,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 92 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:36,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-02-21 00:02:36,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2022-02-21 00:02:36,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:36,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 85 states, 84 states have (on average 1.6071428571428572) internal successors, (135), 84 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (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,146 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 85 states, 84 states have (on average 1.6071428571428572) internal successors, (135), 84 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (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,146 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 85 states, 84 states have (on average 1.6071428571428572) internal successors, (135), 84 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (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,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:36,148 INFO L93 Difference]: Finished difference Result 87 states and 136 transitions. [2022-02-21 00:02:36,148 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 136 transitions. [2022-02-21 00:02:36,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:36,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:36,149 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 84 states have (on average 1.6071428571428572) internal successors, (135), 84 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 87 states. [2022-02-21 00:02:36,149 INFO L87 Difference]: Start difference. First operand has 85 states, 84 states have (on average 1.6071428571428572) internal successors, (135), 84 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 87 states. [2022-02-21 00:02:36,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:36,151 INFO L93 Difference]: Finished difference Result 87 states and 136 transitions. [2022-02-21 00:02:36,151 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 136 transitions. [2022-02-21 00:02:36,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:36,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:36,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:36,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:36,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.6071428571428572) internal successors, (135), 84 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (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,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 135 transitions. [2022-02-21 00:02:36,154 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 135 transitions. Word has length 15 [2022-02-21 00:02:36,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:36,155 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 135 transitions. [2022-02-21 00:02:36,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (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,155 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 135 transitions. [2022-02-21 00:02:36,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-21 00:02:36,155 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:36,155 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:36,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-21 00:02:36,156 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:36,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:36,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1262622730, now seen corresponding path program 1 times [2022-02-21 00:02:36,156 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:36,156 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738982310] [2022-02-21 00:02:36,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:36,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:36,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {1807#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(15, 2);call #Ultimate.allocInit(12, 3); {1807#true} is VALID [2022-02-21 00:02:36,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {1807#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_~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_~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;havoc main_~cond~0#1; {1807#true} is VALID [2022-02-21 00:02:36,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {1807#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {1807#true} is VALID [2022-02-21 00:02:36,178 INFO L290 TraceCheckUtils]: 3: Hoare triple {1807#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; {1807#true} is VALID [2022-02-21 00:02:36,178 INFO L290 TraceCheckUtils]: 4: Hoare triple {1807#true} assume !(0 != main_~p1~0#1); {1807#true} is VALID [2022-02-21 00:02:36,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {1807#true} assume !(0 != main_~p2~0#1); {1807#true} is VALID [2022-02-21 00:02:36,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {1807#true} assume !(0 != main_~p3~0#1); {1809#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:36,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {1809#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1809#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:36,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {1809#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1809#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:36,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {1809#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1809#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:36,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {1809#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p1~0#1); {1809#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:36,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {1809#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p2~0#1); {1809#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:36,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {1809#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p3~0#1; {1808#false} is VALID [2022-02-21 00:02:36,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {1808#false} assume 1 != main_~lk3~0#1; {1808#false} is VALID [2022-02-21 00:02:36,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {1808#false} assume !false; {1808#false} is VALID [2022-02-21 00:02:36,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:36,181 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:36,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738982310] [2022-02-21 00:02:36,182 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738982310] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:36,182 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:36,182 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:36,182 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946671041] [2022-02-21 00:02:36,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:36,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-02-21 00:02:36,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:36,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (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,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:36,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:36,194 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:36,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:36,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:36,195 INFO L87 Difference]: Start difference. First operand 85 states and 135 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (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,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:36,234 INFO L93 Difference]: Finished difference Result 159 states and 244 transitions. [2022-02-21 00:02:36,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:36,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-02-21 00:02:36,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:36,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (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,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-02-21 00:02:36,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (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,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-02-21 00:02:36,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2022-02-21 00:02:36,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:36,283 INFO L225 Difference]: With dead ends: 159 [2022-02-21 00:02:36,284 INFO L226 Difference]: Without dead ends: 159 [2022-02-21 00:02:36,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:36,285 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 27 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 79 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,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 79 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,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-02-21 00:02:36,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2022-02-21 00:02:36,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:36,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 157 states, 156 states have (on average 1.5576923076923077) internal successors, (243), 156 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (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,304 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 157 states, 156 states have (on average 1.5576923076923077) internal successors, (243), 156 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (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,305 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 157 states, 156 states have (on average 1.5576923076923077) internal successors, (243), 156 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (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,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:36,307 INFO L93 Difference]: Finished difference Result 159 states and 244 transitions. [2022-02-21 00:02:36,307 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 244 transitions. [2022-02-21 00:02:36,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:36,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:36,308 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 156 states have (on average 1.5576923076923077) internal successors, (243), 156 states have internal predecessors, (243), 0 states have call successors, (0), 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 159 states. [2022-02-21 00:02:36,308 INFO L87 Difference]: Start difference. First operand has 157 states, 156 states have (on average 1.5576923076923077) internal successors, (243), 156 states have internal predecessors, (243), 0 states have call successors, (0), 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 159 states. [2022-02-21 00:02:36,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:36,311 INFO L93 Difference]: Finished difference Result 159 states and 244 transitions. [2022-02-21 00:02:36,311 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 244 transitions. [2022-02-21 00:02:36,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:36,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:36,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:36,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:36,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.5576923076923077) internal successors, (243), 156 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (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,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 243 transitions. [2022-02-21 00:02:36,314 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 243 transitions. Word has length 15 [2022-02-21 00:02:36,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:36,314 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 243 transitions. [2022-02-21 00:02:36,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (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,314 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 243 transitions. [2022-02-21 00:02:36,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-21 00:02:36,315 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:36,315 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:36,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-21 00:02:36,315 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:36,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:36,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1942681100, now seen corresponding path program 1 times [2022-02-21 00:02:36,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:36,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525379715] [2022-02-21 00:02:36,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:36,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:36,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {2446#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(15, 2);call #Ultimate.allocInit(12, 3); {2446#true} is VALID [2022-02-21 00:02:36,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {2446#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_~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_~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;havoc main_~cond~0#1; {2446#true} is VALID [2022-02-21 00:02:36,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {2446#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {2446#true} is VALID [2022-02-21 00:02:36,341 INFO L290 TraceCheckUtils]: 3: Hoare triple {2446#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; {2446#true} is VALID [2022-02-21 00:02:36,341 INFO L290 TraceCheckUtils]: 4: Hoare triple {2446#true} assume !(0 != main_~p1~0#1); {2446#true} is VALID [2022-02-21 00:02:36,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {2446#true} assume !(0 != main_~p2~0#1); {2446#true} is VALID [2022-02-21 00:02:36,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {2446#true} assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; {2448#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:36,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {2448#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {2448#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:36,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {2448#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2448#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:36,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {2448#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2448#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:36,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {2448#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p1~0#1); {2448#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:36,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {2448#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p2~0#1); {2448#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:36,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {2448#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p3~0#1; {2448#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:36,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {2448#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 1 != main_~lk3~0#1; {2447#false} is VALID [2022-02-21 00:02:36,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {2447#false} assume !false; {2447#false} is VALID [2022-02-21 00:02:36,344 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,344 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:36,344 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525379715] [2022-02-21 00:02:36,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525379715] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:36,345 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:36,345 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:36,345 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770797500] [2022-02-21 00:02:36,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:36,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-02-21 00:02:36,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:36,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (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,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:36,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:36,354 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:36,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:36,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:36,354 INFO L87 Difference]: Start difference. First operand 157 states and 243 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (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,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:36,391 INFO L93 Difference]: Finished difference Result 191 states and 296 transitions. [2022-02-21 00:02:36,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:36,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-02-21 00:02:36,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:36,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (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,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-02-21 00:02:36,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (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,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-02-21 00:02:36,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 67 transitions. [2022-02-21 00:02:36,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:36,428 INFO L225 Difference]: With dead ends: 191 [2022-02-21 00:02:36,428 INFO L226 Difference]: Without dead ends: 191 [2022-02-21 00:02:36,428 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,429 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 22 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 98 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:36,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 98 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:36,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-02-21 00:02:36,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 157. [2022-02-21 00:02:36,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:36,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 157 states, 156 states have (on average 1.5320512820512822) internal successors, (239), 156 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (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,432 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 157 states, 156 states have (on average 1.5320512820512822) internal successors, (239), 156 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (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,432 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 157 states, 156 states have (on average 1.5320512820512822) internal successors, (239), 156 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (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,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:36,435 INFO L93 Difference]: Finished difference Result 191 states and 296 transitions. [2022-02-21 00:02:36,435 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 296 transitions. [2022-02-21 00:02:36,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:36,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:36,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 156 states have (on average 1.5320512820512822) internal successors, (239), 156 states have internal predecessors, (239), 0 states have call successors, (0), 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:36,436 INFO L87 Difference]: Start difference. First operand has 157 states, 156 states have (on average 1.5320512820512822) internal successors, (239), 156 states have internal predecessors, (239), 0 states have call successors, (0), 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:36,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:36,438 INFO L93 Difference]: Finished difference Result 191 states and 296 transitions. [2022-02-21 00:02:36,439 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 296 transitions. [2022-02-21 00:02:36,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:36,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:36,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:36,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.5320512820512822) internal successors, (239), 156 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (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,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 239 transitions. [2022-02-21 00:02:36,441 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 239 transitions. Word has length 15 [2022-02-21 00:02:36,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:36,442 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 239 transitions. [2022-02-21 00:02:36,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (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,442 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 239 transitions. [2022-02-21 00:02:36,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-21 00:02:36,442 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:36,442 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:36,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-21 00:02:36,443 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:36,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:36,443 INFO L85 PathProgramCache]: Analyzing trace with hash -486383640, now seen corresponding path program 1 times [2022-02-21 00:02:36,443 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:36,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240107948] [2022-02-21 00:02:36,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:36,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:36,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {3181#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(15, 2);call #Ultimate.allocInit(12, 3); {3181#true} is VALID [2022-02-21 00:02:36,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {3181#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_~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_~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;havoc main_~cond~0#1; {3181#true} is VALID [2022-02-21 00:02:36,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {3181#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {3181#true} is VALID [2022-02-21 00:02:36,462 INFO L290 TraceCheckUtils]: 3: Hoare triple {3181#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; {3181#true} is VALID [2022-02-21 00:02:36,463 INFO L290 TraceCheckUtils]: 4: Hoare triple {3181#true} assume !(0 != main_~p1~0#1); {3181#true} is VALID [2022-02-21 00:02:36,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {3181#true} assume !(0 != main_~p2~0#1); {3181#true} is VALID [2022-02-21 00:02:36,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {3181#true} assume !(0 != main_~p3~0#1); {3181#true} is VALID [2022-02-21 00:02:36,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {3181#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {3183#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:36,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {3183#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {3183#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:36,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {3183#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {3183#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:36,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {3183#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p1~0#1); {3183#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:36,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {3183#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p2~0#1); {3183#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:36,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {3183#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p3~0#1); {3183#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:36,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {3183#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p4~0#1; {3183#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:36,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {3183#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 1 != main_~lk4~0#1; {3182#false} is VALID [2022-02-21 00:02:36,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {3182#false} assume !false; {3182#false} is VALID [2022-02-21 00:02:36,466 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,466 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:36,466 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240107948] [2022-02-21 00:02:36,466 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240107948] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:36,466 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:36,466 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:36,466 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062564761] [2022-02-21 00:02:36,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:36,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-21 00:02:36,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:36,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:36,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:36,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:36,480 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:36,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:36,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:36,481 INFO L87 Difference]: Start difference. First operand 157 states and 239 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:36,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:36,513 INFO L93 Difference]: Finished difference Result 275 states and 416 transitions. [2022-02-21 00:02:36,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:36,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-21 00:02:36,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:36,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-02-21 00:02:36,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:36,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-02-21 00:02:36,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-02-21 00:02:36,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:36,552 INFO L225 Difference]: With dead ends: 275 [2022-02-21 00:02:36,552 INFO L226 Difference]: Without dead ends: 275 [2022-02-21 00:02:36,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:36,553 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 19 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:36,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 73 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:36,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-02-21 00:02:36,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 225. [2022-02-21 00:02:36,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:36,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand has 225 states, 224 states have (on average 1.4955357142857142) internal successors, (335), 224 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (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,558 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand has 225 states, 224 states have (on average 1.4955357142857142) internal successors, (335), 224 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (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,558 INFO L87 Difference]: Start difference. First operand 275 states. Second operand has 225 states, 224 states have (on average 1.4955357142857142) internal successors, (335), 224 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (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,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:36,562 INFO L93 Difference]: Finished difference Result 275 states and 416 transitions. [2022-02-21 00:02:36,562 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 416 transitions. [2022-02-21 00:02:36,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:36,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:36,563 INFO L74 IsIncluded]: Start isIncluded. First operand has 225 states, 224 states have (on average 1.4955357142857142) internal successors, (335), 224 states have internal predecessors, (335), 0 states have call successors, (0), 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 275 states. [2022-02-21 00:02:36,564 INFO L87 Difference]: Start difference. First operand has 225 states, 224 states have (on average 1.4955357142857142) internal successors, (335), 224 states have internal predecessors, (335), 0 states have call successors, (0), 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 275 states. [2022-02-21 00:02:36,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:36,568 INFO L93 Difference]: Finished difference Result 275 states and 416 transitions. [2022-02-21 00:02:36,568 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 416 transitions. [2022-02-21 00:02:36,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:36,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:36,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:36,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:36,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.4955357142857142) internal successors, (335), 224 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (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,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 335 transitions. [2022-02-21 00:02:36,573 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 335 transitions. Word has length 16 [2022-02-21 00:02:36,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:36,573 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 335 transitions. [2022-02-21 00:02:36,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:36,574 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 335 transitions. [2022-02-21 00:02:36,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-21 00:02:36,574 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:36,574 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:36,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-21 00:02:36,575 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:36,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:36,575 INFO L85 PathProgramCache]: Analyzing trace with hash 193674730, now seen corresponding path program 1 times [2022-02-21 00:02:36,575 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:36,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127629512] [2022-02-21 00:02:36,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:36,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:36,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {4236#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(15, 2);call #Ultimate.allocInit(12, 3); {4236#true} is VALID [2022-02-21 00:02:36,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {4236#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_~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_~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;havoc main_~cond~0#1; {4236#true} is VALID [2022-02-21 00:02:36,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {4236#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {4236#true} is VALID [2022-02-21 00:02:36,598 INFO L290 TraceCheckUtils]: 3: Hoare triple {4236#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; {4236#true} is VALID [2022-02-21 00:02:36,598 INFO L290 TraceCheckUtils]: 4: Hoare triple {4236#true} assume !(0 != main_~p1~0#1); {4236#true} is VALID [2022-02-21 00:02:36,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {4236#true} assume !(0 != main_~p2~0#1); {4236#true} is VALID [2022-02-21 00:02:36,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {4236#true} assume !(0 != main_~p3~0#1); {4236#true} is VALID [2022-02-21 00:02:36,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {4236#true} assume !(0 != main_~p4~0#1); {4238#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:36,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {4238#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {4238#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:36,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {4238#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {4238#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:36,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {4238#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p1~0#1); {4238#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:36,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {4238#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p2~0#1); {4238#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:36,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {4238#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p3~0#1); {4238#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:36,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {4238#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p4~0#1; {4237#false} is VALID [2022-02-21 00:02:36,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {4237#false} assume 1 != main_~lk4~0#1; {4237#false} is VALID [2022-02-21 00:02:36,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {4237#false} assume !false; {4237#false} is VALID [2022-02-21 00:02:36,601 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,601 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:36,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127629512] [2022-02-21 00:02:36,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127629512] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:36,601 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:36,602 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:36,602 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490499001] [2022-02-21 00:02:36,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:36,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-21 00:02:36,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:36,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:36,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:36,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:36,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:36,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:36,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:36,611 INFO L87 Difference]: Start difference. First operand 225 states and 335 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:36,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:36,651 INFO L93 Difference]: Finished difference Result 299 states and 428 transitions. [2022-02-21 00:02:36,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:36,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-21 00:02:36,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:36,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:36,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-02-21 00:02:36,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:36,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-02-21 00:02:36,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2022-02-21 00:02:36,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:36,693 INFO L225 Difference]: With dead ends: 299 [2022-02-21 00:02:36,694 INFO L226 Difference]: Without dead ends: 299 [2022-02-21 00:02:36,694 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,694 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 25 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 90 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,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 90 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,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-02-21 00:02:36,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2022-02-21 00:02:36,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:36,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 299 states. Second operand has 297 states, 296 states have (on average 1.4425675675675675) internal successors, (427), 296 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (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,699 INFO L74 IsIncluded]: Start isIncluded. First operand 299 states. Second operand has 297 states, 296 states have (on average 1.4425675675675675) internal successors, (427), 296 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (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,699 INFO L87 Difference]: Start difference. First operand 299 states. Second operand has 297 states, 296 states have (on average 1.4425675675675675) internal successors, (427), 296 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (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,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:36,704 INFO L93 Difference]: Finished difference Result 299 states and 428 transitions. [2022-02-21 00:02:36,704 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 428 transitions. [2022-02-21 00:02:36,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:36,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:36,705 INFO L74 IsIncluded]: Start isIncluded. First operand has 297 states, 296 states have (on average 1.4425675675675675) internal successors, (427), 296 states have internal predecessors, (427), 0 states have call successors, (0), 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 299 states. [2022-02-21 00:02:36,705 INFO L87 Difference]: Start difference. First operand has 297 states, 296 states have (on average 1.4425675675675675) internal successors, (427), 296 states have internal predecessors, (427), 0 states have call successors, (0), 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 299 states. [2022-02-21 00:02:36,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:36,711 INFO L93 Difference]: Finished difference Result 299 states and 428 transitions. [2022-02-21 00:02:36,711 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 428 transitions. [2022-02-21 00:02:36,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:36,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:36,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:36,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:36,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.4425675675675675) internal successors, (427), 296 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (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,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 427 transitions. [2022-02-21 00:02:36,716 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 427 transitions. Word has length 16 [2022-02-21 00:02:36,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:36,717 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 427 transitions. [2022-02-21 00:02:36,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:36,717 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 427 transitions. [2022-02-21 00:02:36,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-21 00:02:36,717 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:36,718 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:36,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-21 00:02:36,718 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:36,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:36,718 INFO L85 PathProgramCache]: Analyzing trace with hash 2102192011, now seen corresponding path program 1 times [2022-02-21 00:02:36,718 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:36,719 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079501296] [2022-02-21 00:02:36,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:36,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:36,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {5435#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(15, 2);call #Ultimate.allocInit(12, 3); {5435#true} is VALID [2022-02-21 00:02:36,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {5435#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_~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_~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;havoc main_~cond~0#1; {5435#true} is VALID [2022-02-21 00:02:36,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {5435#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {5435#true} is VALID [2022-02-21 00:02:36,737 INFO L290 TraceCheckUtils]: 3: Hoare triple {5435#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; {5435#true} is VALID [2022-02-21 00:02:36,737 INFO L290 TraceCheckUtils]: 4: Hoare triple {5435#true} assume !(0 != main_~p1~0#1); {5435#true} is VALID [2022-02-21 00:02:36,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {5435#true} assume !(0 != main_~p2~0#1); {5435#true} is VALID [2022-02-21 00:02:36,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {5435#true} assume !(0 != main_~p3~0#1); {5435#true} is VALID [2022-02-21 00:02:36,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {5435#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {5437#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:36,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {5437#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {5437#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:36,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {5437#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {5437#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:36,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {5437#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p1~0#1); {5437#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:36,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {5437#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p2~0#1); {5437#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:36,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {5437#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p3~0#1); {5437#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:36,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {5437#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p4~0#1); {5436#false} is VALID [2022-02-21 00:02:36,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {5436#false} assume 0 != main_~p5~0#1; {5436#false} is VALID [2022-02-21 00:02:36,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {5436#false} assume 1 != main_~lk5~0#1; {5436#false} is VALID [2022-02-21 00:02:36,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {5436#false} assume !false; {5436#false} is VALID [2022-02-21 00:02:36,745 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,746 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:36,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079501296] [2022-02-21 00:02:36,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079501296] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:36,746 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:36,746 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:36,746 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814668734] [2022-02-21 00:02:36,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:36,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-21 00:02:36,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:36,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:36,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:36,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:36,755 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:36,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:36,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:36,756 INFO L87 Difference]: Start difference. First operand 297 states and 427 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:36,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:36,791 INFO L93 Difference]: Finished difference Result 311 states and 436 transitions. [2022-02-21 00:02:36,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:36,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-21 00:02:36,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:36,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:36,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-02-21 00:02:36,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:36,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-02-21 00:02:36,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-02-21 00:02:36,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:36,830 INFO L225 Difference]: With dead ends: 311 [2022-02-21 00:02:36,831 INFO L226 Difference]: Without dead ends: 311 [2022-02-21 00:02:36,831 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,831 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 84 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:36,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 84 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:36,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-02-21 00:02:36,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2022-02-21 00:02:36,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:36,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 311 states. Second operand has 309 states, 308 states have (on average 1.4123376623376624) internal successors, (435), 308 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (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,836 INFO L74 IsIncluded]: Start isIncluded. First operand 311 states. Second operand has 309 states, 308 states have (on average 1.4123376623376624) internal successors, (435), 308 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (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,837 INFO L87 Difference]: Start difference. First operand 311 states. Second operand has 309 states, 308 states have (on average 1.4123376623376624) internal successors, (435), 308 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (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,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:36,841 INFO L93 Difference]: Finished difference Result 311 states and 436 transitions. [2022-02-21 00:02:36,841 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 436 transitions. [2022-02-21 00:02:36,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:36,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:36,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 308 states have (on average 1.4123376623376624) internal successors, (435), 308 states have internal predecessors, (435), 0 states have call successors, (0), 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 311 states. [2022-02-21 00:02:36,842 INFO L87 Difference]: Start difference. First operand has 309 states, 308 states have (on average 1.4123376623376624) internal successors, (435), 308 states have internal predecessors, (435), 0 states have call successors, (0), 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 311 states. [2022-02-21 00:02:36,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:36,847 INFO L93 Difference]: Finished difference Result 311 states and 436 transitions. [2022-02-21 00:02:36,847 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 436 transitions. [2022-02-21 00:02:36,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:36,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:36,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:36,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:36,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.4123376623376624) internal successors, (435), 308 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (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,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 435 transitions. [2022-02-21 00:02:36,853 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 435 transitions. Word has length 17 [2022-02-21 00:02:36,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:36,853 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 435 transitions. [2022-02-21 00:02:36,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:36,853 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 435 transitions. [2022-02-21 00:02:36,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-21 00:02:36,854 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:36,854 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:36,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-21 00:02:36,854 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:36,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:36,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1709165001, now seen corresponding path program 1 times [2022-02-21 00:02:36,855 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:36,855 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129178608] [2022-02-21 00:02:36,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:36,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:36,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {6682#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(15, 2);call #Ultimate.allocInit(12, 3); {6682#true} is VALID [2022-02-21 00:02:36,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {6682#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_~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_~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;havoc main_~cond~0#1; {6682#true} is VALID [2022-02-21 00:02:36,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {6682#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {6682#true} is VALID [2022-02-21 00:02:36,873 INFO L290 TraceCheckUtils]: 3: Hoare triple {6682#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; {6682#true} is VALID [2022-02-21 00:02:36,873 INFO L290 TraceCheckUtils]: 4: Hoare triple {6682#true} assume !(0 != main_~p1~0#1); {6682#true} is VALID [2022-02-21 00:02:36,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {6682#true} assume !(0 != main_~p2~0#1); {6682#true} is VALID [2022-02-21 00:02:36,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {6682#true} assume !(0 != main_~p3~0#1); {6682#true} is VALID [2022-02-21 00:02:36,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {6682#true} assume !(0 != main_~p4~0#1); {6682#true} is VALID [2022-02-21 00:02:36,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {6682#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {6684#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:36,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {6684#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {6684#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:36,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {6684#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p1~0#1); {6684#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:36,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {6684#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p2~0#1); {6684#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:36,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {6684#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p3~0#1); {6684#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:36,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {6684#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p4~0#1); {6684#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:36,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {6684#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p5~0#1; {6684#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:36,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {6684#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 1 != main_~lk5~0#1; {6683#false} is VALID [2022-02-21 00:02:36,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {6683#false} assume !false; {6683#false} is VALID [2022-02-21 00:02:36,876 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,876 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:36,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129178608] [2022-02-21 00:02:36,877 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129178608] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:36,877 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:36,877 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:36,877 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391484099] [2022-02-21 00:02:36,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:36,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-21 00:02:36,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:36,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:36,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:36,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:36,886 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:36,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:36,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:36,887 INFO L87 Difference]: Start difference. First operand 309 states and 435 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:36,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:36,925 INFO L93 Difference]: Finished difference Result 519 states and 716 transitions. [2022-02-21 00:02:36,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:36,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-21 00:02:36,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:36,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:36,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-02-21 00:02:36,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:36,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-02-21 00:02:36,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2022-02-21 00:02:36,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:36,964 INFO L225 Difference]: With dead ends: 519 [2022-02-21 00:02:36,964 INFO L226 Difference]: Without dead ends: 519 [2022-02-21 00:02:36,965 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,965 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 16 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:36,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 71 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:36,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-02-21 00:02:36,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 453. [2022-02-21 00:02:36,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:36,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 519 states. Second operand has 453 states, 452 states have (on average 1.3694690265486726) internal successors, (619), 452 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (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,971 INFO L74 IsIncluded]: Start isIncluded. First operand 519 states. Second operand has 453 states, 452 states have (on average 1.3694690265486726) internal successors, (619), 452 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (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,971 INFO L87 Difference]: Start difference. First operand 519 states. Second operand has 453 states, 452 states have (on average 1.3694690265486726) internal successors, (619), 452 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (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,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:36,981 INFO L93 Difference]: Finished difference Result 519 states and 716 transitions. [2022-02-21 00:02:36,981 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 716 transitions. [2022-02-21 00:02:36,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:36,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:36,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 453 states, 452 states have (on average 1.3694690265486726) internal successors, (619), 452 states have internal predecessors, (619), 0 states have call successors, (0), 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 519 states. [2022-02-21 00:02:36,982 INFO L87 Difference]: Start difference. First operand has 453 states, 452 states have (on average 1.3694690265486726) internal successors, (619), 452 states have internal predecessors, (619), 0 states have call successors, (0), 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 519 states. [2022-02-21 00:02:36,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:36,995 INFO L93 Difference]: Finished difference Result 519 states and 716 transitions. [2022-02-21 00:02:36,995 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 716 transitions. [2022-02-21 00:02:36,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:36,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:36,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:36,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:36,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.3694690265486726) internal successors, (619), 452 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (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,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 619 transitions. [2022-02-21 00:02:37,004 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 619 transitions. Word has length 17 [2022-02-21 00:02:37,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:37,009 INFO L470 AbstractCegarLoop]: Abstraction has 453 states and 619 transitions. [2022-02-21 00:02:37,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,009 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 619 transitions. [2022-02-21 00:02:37,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-21 00:02:37,010 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:37,010 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:37,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-21 00:02:37,010 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:37,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:37,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1905743925, now seen corresponding path program 1 times [2022-02-21 00:02:37,011 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:37,011 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311735655] [2022-02-21 00:02:37,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:37,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:37,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {8697#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(15, 2);call #Ultimate.allocInit(12, 3); {8697#true} is VALID [2022-02-21 00:02:37,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {8697#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_~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_~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;havoc main_~cond~0#1; {8697#true} is VALID [2022-02-21 00:02:37,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {8697#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {8697#true} is VALID [2022-02-21 00:02:37,028 INFO L290 TraceCheckUtils]: 3: Hoare triple {8697#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; {8697#true} is VALID [2022-02-21 00:02:37,028 INFO L290 TraceCheckUtils]: 4: Hoare triple {8697#true} assume !(0 != main_~p1~0#1); {8697#true} is VALID [2022-02-21 00:02:37,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {8697#true} assume !(0 != main_~p2~0#1); {8697#true} is VALID [2022-02-21 00:02:37,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {8697#true} assume !(0 != main_~p3~0#1); {8697#true} is VALID [2022-02-21 00:02:37,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {8697#true} assume !(0 != main_~p4~0#1); {8697#true} is VALID [2022-02-21 00:02:37,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {8697#true} assume !(0 != main_~p5~0#1); {8699#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:37,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {8699#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {8699#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:37,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {8699#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p1~0#1); {8699#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:37,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {8699#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p2~0#1); {8699#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:37,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {8699#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p3~0#1); {8699#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:37,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {8699#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p4~0#1); {8699#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:37,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {8699#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p5~0#1; {8698#false} is VALID [2022-02-21 00:02:37,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {8698#false} assume 1 != main_~lk5~0#1; {8698#false} is VALID [2022-02-21 00:02:37,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {8698#false} assume !false; {8698#false} is VALID [2022-02-21 00:02:37,031 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,031 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:37,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311735655] [2022-02-21 00:02:37,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311735655] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:37,032 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:37,032 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:37,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733146904] [2022-02-21 00:02:37,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:37,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-21 00:02:37,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:37,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:37,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:37,044 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:37,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:37,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:37,044 INFO L87 Difference]: Start difference. First operand 453 states and 619 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:37,095 INFO L93 Difference]: Finished difference Result 583 states and 756 transitions. [2022-02-21 00:02:37,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:37,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-21 00:02:37,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-02-21 00:02:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-02-21 00:02:37,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-02-21 00:02:37,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:37,140 INFO L225 Difference]: With dead ends: 583 [2022-02-21 00:02:37,141 INFO L226 Difference]: Without dead ends: 583 [2022-02-21 00:02:37,141 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:37,141 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 24 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 91 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:37,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 91 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:37,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2022-02-21 00:02:37,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 581. [2022-02-21 00:02:37,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:37,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 583 states. Second operand has 581 states, 580 states have (on average 1.3017241379310345) internal successors, (755), 580 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (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,148 INFO L74 IsIncluded]: Start isIncluded. First operand 583 states. Second operand has 581 states, 580 states have (on average 1.3017241379310345) internal successors, (755), 580 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (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,149 INFO L87 Difference]: Start difference. First operand 583 states. Second operand has 581 states, 580 states have (on average 1.3017241379310345) internal successors, (755), 580 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (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,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:37,160 INFO L93 Difference]: Finished difference Result 583 states and 756 transitions. [2022-02-21 00:02:37,160 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 756 transitions. [2022-02-21 00:02:37,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:37,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:37,161 INFO L74 IsIncluded]: Start isIncluded. First operand has 581 states, 580 states have (on average 1.3017241379310345) internal successors, (755), 580 states have internal predecessors, (755), 0 states have call successors, (0), 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 583 states. [2022-02-21 00:02:37,162 INFO L87 Difference]: Start difference. First operand has 581 states, 580 states have (on average 1.3017241379310345) internal successors, (755), 580 states have internal predecessors, (755), 0 states have call successors, (0), 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 583 states. [2022-02-21 00:02:37,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:37,173 INFO L93 Difference]: Finished difference Result 583 states and 756 transitions. [2022-02-21 00:02:37,173 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 756 transitions. [2022-02-21 00:02:37,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:37,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:37,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:37,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:37,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 1.3017241379310345) internal successors, (755), 580 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (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,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 755 transitions. [2022-02-21 00:02:37,185 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 755 transitions. Word has length 17 [2022-02-21 00:02:37,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:37,186 INFO L470 AbstractCegarLoop]: Abstraction has 581 states and 755 transitions. [2022-02-21 00:02:37,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,186 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 755 transitions. [2022-02-21 00:02:37,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-21 00:02:37,186 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:37,187 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:37,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-21 00:02:37,187 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:37,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:37,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1444723487, now seen corresponding path program 1 times [2022-02-21 00:02:37,187 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:37,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948883858] [2022-02-21 00:02:37,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:37,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:37,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {11032#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(15, 2);call #Ultimate.allocInit(12, 3); {11032#true} is VALID [2022-02-21 00:02:37,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {11032#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_~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_~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;havoc main_~cond~0#1; {11032#true} is VALID [2022-02-21 00:02:37,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {11032#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {11032#true} is VALID [2022-02-21 00:02:37,205 INFO L290 TraceCheckUtils]: 3: Hoare triple {11032#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; {11032#true} is VALID [2022-02-21 00:02:37,205 INFO L290 TraceCheckUtils]: 4: Hoare triple {11032#true} assume !(0 != main_~p1~0#1); {11032#true} is VALID [2022-02-21 00:02:37,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {11032#true} assume !(0 != main_~p2~0#1); {11032#true} is VALID [2022-02-21 00:02:37,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {11032#true} assume !(0 != main_~p3~0#1); {11032#true} is VALID [2022-02-21 00:02:37,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {11032#true} assume !(0 != main_~p4~0#1); {11032#true} is VALID [2022-02-21 00:02:37,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {11032#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {11034#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:37,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {11034#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {11034#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:37,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {11034#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p1~0#1); {11034#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:37,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {11034#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p2~0#1); {11034#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:37,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {11034#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p3~0#1); {11034#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:37,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {11034#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p4~0#1); {11034#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:37,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {11034#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p5~0#1); {11033#false} is VALID [2022-02-21 00:02:37,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {11033#false} assume 0 != main_~p6~0#1; {11033#false} is VALID [2022-02-21 00:02:37,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {11033#false} assume 1 != main_~lk6~0#1; {11033#false} is VALID [2022-02-21 00:02:37,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {11033#false} assume !false; {11033#false} is VALID [2022-02-21 00:02:37,208 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,208 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:37,208 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948883858] [2022-02-21 00:02:37,209 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948883858] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:37,209 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:37,209 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:37,209 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790937538] [2022-02-21 00:02:37,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:37,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-21 00:02:37,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:37,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:37,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:37,218 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:37,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:37,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:37,219 INFO L87 Difference]: Start difference. First operand 581 states and 755 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:37,262 INFO L93 Difference]: Finished difference Result 599 states and 756 transitions. [2022-02-21 00:02:37,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:37,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-21 00:02:37,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:37,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-02-21 00:02:37,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-02-21 00:02:37,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2022-02-21 00:02:37,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:37,306 INFO L225 Difference]: With dead ends: 599 [2022-02-21 00:02:37,307 INFO L226 Difference]: Without dead ends: 599 [2022-02-21 00:02:37,307 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:37,307 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 26 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 80 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:37,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 80 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:37,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-02-21 00:02:37,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2022-02-21 00:02:37,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:37,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 599 states. Second operand has 597 states, 596 states have (on average 1.266778523489933) internal successors, (755), 596 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (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,320 INFO L74 IsIncluded]: Start isIncluded. First operand 599 states. Second operand has 597 states, 596 states have (on average 1.266778523489933) internal successors, (755), 596 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (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,320 INFO L87 Difference]: Start difference. First operand 599 states. Second operand has 597 states, 596 states have (on average 1.266778523489933) internal successors, (755), 596 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (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 L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:37,332 INFO L93 Difference]: Finished difference Result 599 states and 756 transitions. [2022-02-21 00:02:37,332 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 756 transitions. [2022-02-21 00:02:37,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:37,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:37,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 597 states, 596 states have (on average 1.266778523489933) internal successors, (755), 596 states have internal predecessors, (755), 0 states have call successors, (0), 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 599 states. [2022-02-21 00:02:37,334 INFO L87 Difference]: Start difference. First operand has 597 states, 596 states have (on average 1.266778523489933) internal successors, (755), 596 states have internal predecessors, (755), 0 states have call successors, (0), 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 599 states. [2022-02-21 00:02:37,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:37,345 INFO L93 Difference]: Finished difference Result 599 states and 756 transitions. [2022-02-21 00:02:37,345 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 756 transitions. [2022-02-21 00:02:37,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:37,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:37,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:37,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:37,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.266778523489933) internal successors, (755), 596 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (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,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 755 transitions. [2022-02-21 00:02:37,357 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 755 transitions. Word has length 18 [2022-02-21 00:02:37,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:37,358 INFO L470 AbstractCegarLoop]: Abstraction has 597 states and 755 transitions. [2022-02-21 00:02:37,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,358 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 755 transitions. [2022-02-21 00:02:37,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-21 00:02:37,358 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:37,359 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:37,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-21 00:02:37,359 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:37,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:37,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1051696477, now seen corresponding path program 1 times [2022-02-21 00:02:37,359 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:37,360 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675163749] [2022-02-21 00:02:37,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:37,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:37,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {13431#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(15, 2);call #Ultimate.allocInit(12, 3); {13431#true} is VALID [2022-02-21 00:02:37,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {13431#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_~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_~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;havoc main_~cond~0#1; {13431#true} is VALID [2022-02-21 00:02:37,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {13431#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {13431#true} is VALID [2022-02-21 00:02:37,375 INFO L290 TraceCheckUtils]: 3: Hoare triple {13431#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; {13431#true} is VALID [2022-02-21 00:02:37,375 INFO L290 TraceCheckUtils]: 4: Hoare triple {13431#true} assume !(0 != main_~p1~0#1); {13431#true} is VALID [2022-02-21 00:02:37,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {13431#true} assume !(0 != main_~p2~0#1); {13431#true} is VALID [2022-02-21 00:02:37,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {13431#true} assume !(0 != main_~p3~0#1); {13431#true} is VALID [2022-02-21 00:02:37,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {13431#true} assume !(0 != main_~p4~0#1); {13431#true} is VALID [2022-02-21 00:02:37,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {13431#true} assume !(0 != main_~p5~0#1); {13431#true} is VALID [2022-02-21 00:02:37,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {13431#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {13433#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:37,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {13433#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p1~0#1); {13433#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:37,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {13433#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p2~0#1); {13433#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:37,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {13433#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p3~0#1); {13433#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:37,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {13433#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p4~0#1); {13433#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:37,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {13433#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p5~0#1); {13433#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:37,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {13433#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p6~0#1; {13433#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:37,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {13433#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 1 != main_~lk6~0#1; {13432#false} is VALID [2022-02-21 00:02:37,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {13432#false} assume !false; {13432#false} is VALID [2022-02-21 00:02:37,379 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,379 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:37,379 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675163749] [2022-02-21 00:02:37,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675163749] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:37,379 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:37,379 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:37,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866231353] [2022-02-21 00:02:37,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:37,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-21 00:02:37,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:37,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:37,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:37,389 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:37,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:37,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:37,390 INFO L87 Difference]: Start difference. First operand 597 states and 755 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:37,442 INFO L93 Difference]: Finished difference Result 965 states and 1171 transitions. [2022-02-21 00:02:37,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:37,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-21 00:02:37,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:37,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-02-21 00:02:37,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-02-21 00:02:37,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 57 transitions. [2022-02-21 00:02:37,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:37,498 INFO L225 Difference]: With dead ends: 965 [2022-02-21 00:02:37,498 INFO L226 Difference]: Without dead ends: 965 [2022-02-21 00:02:37,498 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:37,499 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 12 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 68 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:37,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 68 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:37,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2022-02-21 00:02:37,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 901. [2022-02-21 00:02:37,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:37,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 965 states. Second operand has 901 states, 900 states have (on average 1.23) internal successors, (1107), 900 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,509 INFO L74 IsIncluded]: Start isIncluded. First operand 965 states. Second operand has 901 states, 900 states have (on average 1.23) internal successors, (1107), 900 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,510 INFO L87 Difference]: Start difference. First operand 965 states. Second operand has 901 states, 900 states have (on average 1.23) internal successors, (1107), 900 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:37,537 INFO L93 Difference]: Finished difference Result 965 states and 1171 transitions. [2022-02-21 00:02:37,537 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1171 transitions. [2022-02-21 00:02:37,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:37,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:37,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 901 states, 900 states have (on average 1.23) internal successors, (1107), 900 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 965 states. [2022-02-21 00:02:37,540 INFO L87 Difference]: Start difference. First operand has 901 states, 900 states have (on average 1.23) internal successors, (1107), 900 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 965 states. [2022-02-21 00:02:37,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:37,569 INFO L93 Difference]: Finished difference Result 965 states and 1171 transitions. [2022-02-21 00:02:37,569 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1171 transitions. [2022-02-21 00:02:37,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:37,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:37,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:37,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:37,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 1.23) internal successors, (1107), 900 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1107 transitions. [2022-02-21 00:02:37,597 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1107 transitions. Word has length 18 [2022-02-21 00:02:37,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:37,597 INFO L470 AbstractCegarLoop]: Abstraction has 901 states and 1107 transitions. [2022-02-21 00:02:37,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,597 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1107 transitions. [2022-02-21 00:02:37,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-21 00:02:37,598 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:37,598 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:37,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-21 00:02:37,599 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:37,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:37,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1731754847, now seen corresponding path program 1 times [2022-02-21 00:02:37,599 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:37,599 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838215262] [2022-02-21 00:02:37,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:37,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:37,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {17232#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(15, 2);call #Ultimate.allocInit(12, 3); {17232#true} is VALID [2022-02-21 00:02:37,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {17232#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_~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_~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;havoc main_~cond~0#1; {17232#true} is VALID [2022-02-21 00:02:37,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {17232#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {17232#true} is VALID [2022-02-21 00:02:37,614 INFO L290 TraceCheckUtils]: 3: Hoare triple {17232#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; {17232#true} is VALID [2022-02-21 00:02:37,614 INFO L290 TraceCheckUtils]: 4: Hoare triple {17232#true} assume !(0 != main_~p1~0#1); {17232#true} is VALID [2022-02-21 00:02:37,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {17232#true} assume !(0 != main_~p2~0#1); {17232#true} is VALID [2022-02-21 00:02:37,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {17232#true} assume !(0 != main_~p3~0#1); {17232#true} is VALID [2022-02-21 00:02:37,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {17232#true} assume !(0 != main_~p4~0#1); {17232#true} is VALID [2022-02-21 00:02:37,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {17232#true} assume !(0 != main_~p5~0#1); {17232#true} is VALID [2022-02-21 00:02:37,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {17232#true} assume !(0 != main_~p6~0#1); {17234#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:37,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {17234#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p1~0#1); {17234#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:37,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {17234#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p2~0#1); {17234#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:37,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {17234#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p3~0#1); {17234#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:37,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {17234#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p4~0#1); {17234#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:37,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {17234#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p5~0#1); {17234#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:37,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {17234#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p6~0#1; {17233#false} is VALID [2022-02-21 00:02:37,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {17233#false} assume 1 != main_~lk6~0#1; {17233#false} is VALID [2022-02-21 00:02:37,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {17233#false} assume !false; {17233#false} is VALID [2022-02-21 00:02:37,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:37,624 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:37,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838215262] [2022-02-21 00:02:37,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838215262] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:37,624 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:37,624 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:37,624 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162808856] [2022-02-21 00:02:37,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:37,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-21 00:02:37,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:37,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:37,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:37,634 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:37,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:37,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:37,635 INFO L87 Difference]: Start difference. First operand 901 states and 1107 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:37,708 INFO L93 Difference]: Finished difference Result 1123 states and 1282 transitions. [2022-02-21 00:02:37,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:37,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-21 00:02:37,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-02-21 00:02:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-02-21 00:02:37,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-02-21 00:02:37,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:37,743 INFO L225 Difference]: With dead ends: 1123 [2022-02-21 00:02:37,743 INFO L226 Difference]: Without dead ends: 0 [2022-02-21 00:02:37,743 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:37,744 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 22 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 90 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:37,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 90 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:37,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-21 00:02:37,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-21 00:02:37,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:37,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,745 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,745 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:37,745 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 00:02:37,745 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 00:02:37,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:37,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:37,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-21 00:02:37,746 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-21 00:02:37,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:37,746 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 00:02:37,746 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 00:02:37,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:37,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:37,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:37,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:37,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 00:02:37,747 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-02-21 00:02:37,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:37,747 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 00:02:37,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,748 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 00:02:37,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:37,750 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-02-21 00:02:37,750 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-02-21 00:02:37,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-21 00:02:37,753 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:37,753 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 00:02:37,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 12:02:37 BoogieIcfgContainer [2022-02-21 00:02:37,755 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 00:02:37,756 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 00:02:37,756 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 00:02:37,756 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 00:02:37,756 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:34" (3/4) ... [2022-02-21 00:02:37,758 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-21 00:02:37,764 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-02-21 00:02:37,765 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-21 00:02:37,765 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-02-21 00:02:37,765 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-21 00:02:37,786 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 00:02:37,786 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 00:02:37,787 INFO L158 Benchmark]: Toolchain (without parser) took 3684.62ms. Allocated memory was 71.3MB in the beginning and 125.8MB in the end (delta: 54.5MB). Free memory was 48.8MB in the beginning and 84.1MB in the end (delta: -35.2MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2022-02-21 00:02:37,787 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 71.3MB. Free memory is still 49.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:02:37,787 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.48ms. Allocated memory is still 71.3MB. Free memory was 48.6MB in the beginning and 47.5MB in the end (delta: 1.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 00:02:37,787 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.20ms. Allocated memory is still 71.3MB. Free memory was 47.3MB in the beginning and 45.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:02:37,788 INFO L158 Benchmark]: Boogie Preprocessor took 30.62ms. Allocated memory is still 71.3MB. Free memory was 45.7MB in the beginning and 44.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 00:02:37,788 INFO L158 Benchmark]: RCFGBuilder took 371.22ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 44.4MB in the beginning and 63.3MB in the end (delta: -18.9MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2022-02-21 00:02:37,788 INFO L158 Benchmark]: TraceAbstraction took 3025.10ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 62.7MB in the beginning and 86.2MB in the end (delta: -23.5MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2022-02-21 00:02:37,788 INFO L158 Benchmark]: Witness Printer took 30.54ms. Allocated memory is still 125.8MB. Free memory was 86.2MB in the beginning and 84.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 00:02:37,789 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 71.3MB. Free memory is still 49.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.48ms. Allocated memory is still 71.3MB. Free memory was 48.6MB in the beginning and 47.5MB in the end (delta: 1.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.20ms. Allocated memory is still 71.3MB. Free memory was 47.3MB in the beginning and 45.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.62ms. Allocated memory is still 71.3MB. Free memory was 45.7MB in the beginning and 44.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 371.22ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 44.4MB in the beginning and 63.3MB in the end (delta: -18.9MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3025.10ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 62.7MB in the beginning and 86.2MB in the end (delta: -23.5MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * Witness Printer took 30.54ms. Allocated memory is still 125.8MB. Free memory was 86.2MB in the beginning and 84.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 107]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 425 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 425 mSDsluCounter, 1432 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 523 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 86 IncrementalHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 909 mSDtfsCounter, 86 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=901occurred in iteration=17, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 268 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 243 ConstructedInterpolants, 0 QuantifiedInterpolants, 479 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-21 00:02:37,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE